]]>
涓昏鏄緩鍥撅紝鐪嬩笉鎳傜殑璇濆彲浠ュ拰鎴戜氦嫻?nbsp; 闃呰鍏ㄦ枃
]]>
璺熷墠闈㈠仛鐨勯鐩竴鏍楓?
寤虹珛涓涓猻t-緗?
s榪炰笂x鐨?y榪炰笂t
x->y
娉ㄦ剰鍘繪帀0-0鐘舵?nbsp; 闃呰鍏ㄦ枃
]]>
鏈澶ф祦鐢? 鍖堢墮鍒?鎴栬呮渶澶ф祦錛堝緩鍥?婧愮偣s榪炰笂鎵鏈夌殑鐗涳紝鎵鏈夌殑媯氳繛涓婃眹鐐箃錛?nbsp; 闃呰鍏ㄦ枃
]]>
]]>
#include<iostream>#include<cmath>using namespace std;#define MAXN 1002#define inf 1000000000typedef double elem_t;elem_t mat[MAXN][MAXN];elem_t dist[MAXN];int num[MAXN][2];double distance(int a1,int a2,int b1,int b2)
{
return sqrt((double)((a1-b1)*(a1-b1)+(a2-b2)*(a2-b2)));
}void dijkstra(int n,int s){ int v[MAXN],i,j; int k; for (i=0;i<n;i++) dist[i]=mat[s][i],v[i]=0;//鍒濆鍖?/span> 
for (dist[s]=0,j=0;j<n;j++){ for (k=-1,i=0;i<n;i++)//浼拌璁¤窛紱繪渶灝忕殑欏剁偣k if (!v[i]&&(k==-1||dist[i] < dist[k])) k=i; for (v[k]=1,i=0;i<n;i++) if (!v[i] && mat[k][i]>0.0)//&& max(dist[k],mat[k][i]) > dist[i]) { dist[i] = min( max(dist[k],mat[k][i]),dist[i]); //dist[i]=min(dist[k],mat[k][i]);
} }}int main(){ int n,m,k,x1,y1; for(int i = 1;;i ++){ scanf("%d",&n); if( n == 0)break; memset(mat,0,sizeof(mat)); for( int j=0;j<n;j++) scanf("%d %d",&num[j][0],&num[j][1]); for( int k=0;k<n;k++) for( int j=0;j<n;j++){ mat[k][j]=distance(num[k][0],num[k][1],num[j][0],num[j][1]); } dijkstra(n,0); printf("Scenario #%d\n",i); printf("Frog Distance = %0.3lf\n\n",dist[1]);//dist[n-1]<<endl<<endl; } return 0;}/**//*13 31 2 31 3 42 3 5*/]]>
/**//* 璧風(fēng)偣鍒皀鐐?nbsp;璺緞涓?nbsp; 鎵鑳芥壙鍙楃殑 鏈澶ч噸閲忕殑杞?br> dist[k] 婧愮偣鍒発 璺緞涓渶灝忕殑閭ｄ釜杈規(guī)潈鍊?nbsp; mat[k][i]杈筴-i鏉冨?nbsp; 鍙栬礬寰?nbsp;dist[k] 鍜宮at銆恔銆戙恑銆戣竟鏈澶ч偅涓?nbsp; 鏇存柊 dist[i] */#include<iostream>using namespace std;#define MAXN 1002#define inf 1000000000typedef int elem_t;int mat[MAXN][MAXN];int dist[MAXN];void dijkstra(int n,int s){ int v[MAXN],i,j,k; for (i=0;i<n;i++) dist[i]=mat[s][i],v[i]=0;//鍒濆鍖?/span> for (dist[s]=0,j=0;j<n;j++){ for (k=-1,i=0;i<n;i++)//浼拌璁¤窛紱繪渶灝忕殑欏剁偣k if (!v[i]&&(k==-1||dist[i] > dist[k])) k=i; for (v[k]=1,i=0;i<n;i++) if (!v[i] && mat[k][i]>0&& min(dist[k],mat[k][i]) > dist[i]) { dist[i]=min(dist[k],mat[k][i]); } }}int main(){ int cases; int n,m,k,x1,y1; cin>>cases; for(int i = 1;i <= cases;i ++){ cin>>n>>m; memset(mat,0,sizeof(mat)); for(int j=0;j<m;j++){ cin>>x1>>y1>>k; mat[x1-1][y1-1]=k; mat[y1-1][x1-1]=k; dijkstra(n,0); cout<<"Scenario #"<<i<<":"<<endl; cout<<dist[n-1]<<endl<<endl; } return 0;}/**//*13 31 2 31 3 42 3 5*/
http://acm.pku.edu.cn/JudgeOnline/problem?id=1797
]]>
鏈灝忕敓鎴愭爲(wèi)鏈闀胯竟錛岃鏁伴噺涓嶈璐ㄩ噺錛岀┖铏氱殑棰樼洰緇忛獙錛?555
#include<iostream>
using namespace std;
int n;
#define MAXN 501
#define inf 65537
int map[MAXN][MAXN];//visited[N];
typedef int elem_t;
elem_t prim(int n,elem_t mat[][MAXN]){
elem_t min[MAXN],ret=0;
int v[MAXN],i,j,k;
for (i=0;i<n;i++)
min[i]=inf,v[i]=0;
for (min[j=0]=0;j<n;j++){
for (k=-1,i=0;i<n;i++)
if (!v[i]&&(k==-1||min[i]<min[k]))
k=i;
for (v[k]=1,ret+=min[k],i=0;i<n;i++)
if (!v[i]&&mat[k][i]<min[i])
min[i]=mat[k][i];
}
int max=0;
for(int i=0;i<n;i++){ //鎵炬渶澶ц竟鏉?nbsp;
if(max<min[i])max=min[i];
}
return max;
//return ret;
}
int main()
{
// ifstream fcin("agrinet.in");
// ofstream fcout("agrinet.out");
int i,j,k,sum=0,node;
int dist;
int cas;
scanf("%d",&cas);
while( cas -- ){
scanf("%d",&n);
memset( map,inf, sizeof(map));
for( i=0;i<n;i++)
for( j=0;j<n;j++){
scanf("%d",&map[i][j]);
}
printf("%d\n",prim(n,map));
}
//system("pause");
return 0;
}
using namespace std;
int n;
#define MAXN 501
#define inf 65537
int map[MAXN][MAXN];//visited[N];
typedef int elem_t;
elem_t prim(int n,elem_t mat[][MAXN]){
elem_t min[MAXN],ret=0;
int v[MAXN],i,j,k;
for (i=0;i<n;i++)
min[i]=inf,v[i]=0;
for (min[j=0]=0;j<n;j++){
for (k=-1,i=0;i<n;i++)
if (!v[i]&&(k==-1||min[i]<min[k]))
k=i;
for (v[k]=1,ret+=min[k],i=0;i<n;i++)
if (!v[i]&&mat[k][i]<min[i])
min[i]=mat[k][i];
}
int max=0;
for(int i=0;i<n;i++){ //鎵炬渶澶ц竟鏉?nbsp;
if(max<min[i])max=min[i];
}
return max;
//return ret;
}
int main()
{
// ifstream fcin("agrinet.in");
// ofstream fcout("agrinet.out");
int i,j,k,sum=0,node;
int dist;
int cas;
scanf("%d",&cas);
while( cas -- ){
scanf("%d",&n);
memset( map,inf, sizeof(map));
for( i=0;i<n;i++)
for( j=0;j<n;j++){
scanf("%d",&map[i][j]);
}
printf("%d\n",prim(n,map));
}
//system("pause");
return 0;
}
]]>
using namespace std;
#define maxn 2001
int cost[maxn];//璁板綍鏉冨肩殑鏁扮粍
int used[maxn];//鍒ゆ柇鐐規(guī)槸鍚﹁闂繃
int graph[maxn][maxn];
char s[maxn][8];
int n;
int solve()//鐢╬rime綆楁硶鐨勫嚱鏁?/span>
{
int legth = 0;//鎬繪潈鍊?/span>
for(int ix = 0; ix < n; ix++)
{
cost[ix] = graph[0][ix];
used[ix] = 0;
}
used[0] = 1;
for(;;)
{
int j = 0, i = 0;
while(used[j] && j < n)
j++;//鎵句竴涓病璁塊棶鐨勭偣
if(j == n) break;//濡傛灉閮借闂繃浜?jiǎn)锛岃窙_嚭寰幆
for(i = 0; i < n; i++)
if(!used[i] && cost[i] < cost[j])
j = i;//鍦ㄥ墿涓嬬殑鐐逛腑鎵懼埌鏉冨兼渶灝忕殑鐐癸紙鏉冨?br>//鏄寚璧峰鐐瑰埌姝ょ偣鐨勮礬寰勯暱搴︼級(jí)
legth += cost[j];//鏇存柊鎬繪潈鍊?/span>
used[j] =1;//灝嗘鐐圭疆涓鴻闂繃
for(i = 0; i < n; i++)
if(!used[i] && graph[j][i] < cost[i])
cost[i] = graph[j][i];//鏇存柊鏈闂殑鎵鏈夌偣鐨勬潈鍊?nbsp;
}
// printf("%d\n",legth);
return legth;
}
int main()
{
int i,j,sum;
while(cin>>n){
if( n == 0)break;
for( i=0;i<=n;i++){used[i]=0;cost[i]=0;}
for(i=0;i<n;i++ ){
cin>>s[i];
}
for( i=0;i<n;i++)
for( j=0;j<n;j++){
if( i == j)graph[i][j]=0;
else {
sum=0;
for( int k=0;k<7;k++){
if(s[i][k]!=s[j][k])sum++;
}
graph[i][j]=sum;
}
}
cout<<"The highest possible quality is 1/"<<solve()<<"."<<endl;
}
//system("pause");
return 0;
}
浠婂ぉ絎竴涓竴ac鐨勯鐩?br>鏅曟
鐢╬rim鍋氱殑
閭ｅぉ錛屾垜鍙互寰楀績(jī)搴旀墜鐨?涓ac榪欎簺綆鍗曢鍟?br>鍔犳補(bǔ)錛佸偦鍌誨湴璐磋繖浜涙棤鑱婄殑涓滆タ銆?br>澶栧崠浠旇繕娌￠侀キ鏉ワ紒錛?br>wait銆傘傘傘傘傘傘傘?br>
]]>
]]>
2 ID:dongyun1
3 TASK:agrinet
4 LANG: C++
5 */
6 #include<iostream>
7 //#include<fstream>
8 using namespace std;
9
10 #define N 101
11 int n;
12 int map[N][N],visited[N];
13
14
15 int main()
16 {
17 // ifstream fcin("agrinet.in");
18 // ofstream fcout("agrinet.out");
19 int i,j,k,sum=0,node;
20 int dist;
21
22 while(scanf("%d",&n)!=EOF){
23 // while(cin>>n) {
24
25 memset(visited,0,sizeof( visited));
26 memset( map, 0, sizeof(map));
27
28 for( i=0;i<n;i++)
29 for( j=0;j<n;j++)
30 scanf("%d",&map[i][j]);
31 //cin>>map[i][j];
32
33 sum=0;
34 visited[0]=1;
35
36 for( i=1;i<n;i++){
37 dist=0;
38 for(j=0;j<n;j++)
39 for( k=0;k<n;k++){
40 if( map[j][k] && visited[j] && !visited[k]){//printf("AAAAA\n");
41 if( dist == 0 || map[j][k]< dist){
42 dist = map[j][k];
43 node=k;
44 // printf("tag\n");
45 }
46 }
47 }
48 visited[node]=1;
49 sum+=dist;
50 }
51
52
53 //cout<<sum<<endl;
54 printf("%d\n",sum);
55 }
56 //system("pause");
57
58 return 0;
59 }
60 /*
61 4
62 0 4 9 21
63 4 0 8 17
64 9 8 0 16
65 21 17 16 0
66 2
67 0 2
68 3 0
69 3
70 0 1 2
71 2 0 1
72 2 2 0
73 4
74 0 4 9 21
75 4 0 8 17
76 9 8 0 16
77 21 17 16 0
78
79
80 */
81 綆鍗曢 鏈灝忔垚鏍?br>
]]>