hust1608 Dating With Girls hust校赛 BFS求最长路(二)
}
}
vis[temp]=0;
}
}
int main()
{
int i,m,x,y,min,flag;
while(scanf("%d %d",&n,&m)!=EOF)
{
memset(map,0,sizeof(map));
while(m--)
{
scanf("%d %d",&x,&y);
map[x][y]=1;
min=10000;
for(i=2;i<=n;i++)
{
scanf("%d",&val[i]);
if(min>val[i]) {min=val[i];flag=i;}
}
BFS();
if(mmax[flag]>=0)
printf("%d\n",mmax[flag]);
else printf("What is a fucking day!\n");
}
return 0;
}