bzoj 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏【Floyd】
2018-05-04 09:59
423 查看
先跑一遍取max版的Floyd,直接用数组回答询问即可
#include<iostream> #include<cstdio> using namespace std; const int N=305,inf=1e9; int n,m,q,a ; int read() { int r=0,f=1; char p=getchar(); while(p>'9'||p<'0') { if(p=='-') f=-1; p=getchar(); } while(p>='0'&&p<='9') { r=r*10+p-48; p=getchar(); } return r*f; } int main() { n=read(),m=read(),q=read(); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(i!=j) a[i][j]=inf; for(int i=1;i<=m;i++) { int x=read(),y=read(),z=read(); if(z<a[x][y]) a[x][y]=z; } for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) a[i][j]=min(a[i][j],max(a[i][k],a[k][j])); while(q--) { int x=read(),y=read(); printf("%d\n",a[x][y]==inf?-1:a[x][y]); } return 0; }
相关文章推荐
- bzoj1641 [Usaco2007 Nov]Cow Hurdles 奶牛跨栏(Floyd)
- bzoj 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏 floyd
- bzoj 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏(floyd)
- BZOJ 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏( floyd )
- 【BZOJ】1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏(floyd)
- 【BZOJ 1641】【Usaco2007 Nov】Cow Hurdles 奶牛跨栏(最短路变形)
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏 (Floyd)
- [BZOJ1641][Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- [BZOJ] 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- BZOJ 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 【bzoj1641】 Usaco2007 Nov Cow Hurdles 奶牛跨栏 最短路
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏
- 【bzoj1706】[usaco2007 Nov]relays 奶牛接力跑 离散化+倍增Floyd
- bzoj 1706: [usaco2007 Nov]relays 奶牛接力跑(倍增floyd)
- [倍增Floyd] BZOJ 1706 [usaco2007 Nov]relays 奶牛接力跑
- bzoj 1706: [usaco2007 Nov]relays 奶牛接力跑——倍增floyd