poj 3660 Cow Contest floyd 传递闭包!!基础
2011-11-30 23:27
399 查看
算出比i小的couy,算出比i大的 coux,看相加是不是等于n-1,果断一a!!!
#include<iostream> using namespace std; int map[105][105]; int main() { int n,m,x,y; while(cin>>n>>m) { memset(map,0,sizeof(map)); while(m--) { scanf("%d%d",&x,&y); map[x][y]=1; } for(int k=1;k<=n;k++) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) map[i][j]=max(map[i][j],min(map[i][k],map[k][j])); } } int coux=0,couy=0,cou=0; for(int i=1;i<=n;i++) { coux=0; couy=0; for(int j=1;j<=n;j++) { if(map[i][j]) coux++; if(map[j][i]) couy++; } if(coux+couy==n-1) cou++; } cout<<cou<<endl; } return 0; }
相关文章推荐
- POJ-3660 Cow Contest Floyd传递闭包的应用
- POJ 3660 Cow contests Floyd 传递闭包
- POJ-3660(Cow Contest)——传递闭包
- Cow Contest POJ - 3660(Floyd,传递闭包)
- (POJ 3660)Cow Contest [详解] [floyd] 传递闭包 确定top序列顺序
- Cow Contest POJ - 3660(传递闭包,floyd)
- POJ 3660 Floyd求传递闭包
- POJ - 3660 Cow Contest floyd
- Floyd传递闭包-POJ-3660-Cow Contest
- poj 3660 Cow Contest ----floyd 传递闭包
- Cow Contest POJ - 3660 (floyd求传递闭包)
- POJ 3660 Floyd传递闭包
- POJ 3660 Cow Contest floyd求传递闭包 || bfs
- poj 3660 floyd 传递闭包
- POJ 3660 Cow Contest-floyd传递闭包
- 【POJ】3660 Cow Contest floyd(可以拓扑排序?)
- poj 3660 Cow Contest floyd
- D - Cow Contest POJ - 3660
- poj 3660 Cow Contest Flyod
- Cow Contest(Poj 3660)