| ||||||||||
| 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 | |||||||||
第一道网络流~EK双向广搜_给过了很多数据还是WA的一点意见心浮气躁WA无数次
1.有重边 即会有如下数据
1 2 4
1 2 5
1 2 6
可用map[1][2]+=n;解决
2.server cases啊!!!
可用while(scanf("%d%d",&N,&M)!=EOF)//这个大家肯定都知道。。。。
3.个别的建议:广搜queue不要用全局变量
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator