摘要:
POJ 2112 Optimal Milking (二分+最短路径+网络流)Optimal MilkingTime Limit:2000MSMemory Limit:30000KTotal Submissions:10176Accepted:3698Case Time Limit:1000MSDes... 阅读全文
摘要:
POJ 2135 Farm Tour (最小费用最大流)两遍spfa解决#include #include #include #include #include using namespace std;const int maxn=30000;const int inf=2000000000;str... 阅读全文
摘要:
uva 11553 Grid Game (回溯- 类似,比八皇后问题简单)Problem GGRID GAMEAlice and Bob both have lots of candies but want more. They decide to play the following turn-... 阅读全文