poj2485(prime)

来源：互联网发布：solaris和centos 编辑：程序博客网时间：2024/05/16 07:48

#include<cstdio>#include<cstring>using namespace std;int M[510][510],N,T,book[510],dist[510];int Prime(int cur){    memset(book,0,sizeof(book));    book[cur]=1;    dist[1]=0;    int Min,MaxS=-1;    for(int i=2;i<=N;i++)    {        dist[i]=M[cur][i];    }    for(int i=1;i<N;i++)    {        int index,Min=99999;        for(int j=1;j<=N;j++)        {            if(dist[j]<Min&&!book[j])            {                Min=dist[j];                index=j;            }        }        book[index]=1;        if(Min>MaxS) MaxS=Min;        for(int j=1;j<=N;j++)        {            if(!book[j]&&dist[j]>M[index][j])            {                dist[j]=M[index][j];            }        }    }    return MaxS;}int main(){    scanf("%d",&T);    while(T--)    {        scanf("%d",&N);        for(int i=1;i<=N;i++)           for(int j=1;j<=N;j++)              scanf("%d",&M[i][j]);        printf("%d\n",Prime(1));    }    return 0;}

0 0