| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:1258 求助ing~ c++ prim WAIn Reply To:1258 求助ing~ c++ prim WA Posted by:AKQJT98765432 at 2011-07-09 01:40:53 原来,我的程序没有错……
原来,我只是少运行了几遍……
为什么不告诉我是多组数据???
5555……
不过,终于过了……
附:AC程序(c++ prim)
#include<iostream>
using namespace std;
int n;
int a[1000][1000];
bool flag[1000];
int minl[1000];
int sum;
int num;
void prim(int p)
{
if(num==n)
return;
num++;
flag[p]=1;
sum+=minl[p];
minl[p]=0;
int minp=2147483647,mini;
for(int i=0;i<n;i++)
if(a[i][p]<minl[i])
minl[i]=a[i][p];
for(int i=0;i<n;i++)
if(flag[i]==0 && minl[i]<minp)
{
minp=minl[i];
mini=i;
}
prim(mini);
return;
}
int main()
{
while(cin>>n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
for(int i=1;i<n;i++)
{
minl[i]=2147483647;
flag[i]=0;
}
sum=0;
num=0;
prim(0);
cout<<sum<<endl;
}
//system("pause");
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator