拂晓

题目：A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10861 Accepted: 3562DescriptionYou are in charge of setting up the press room for the inaugural meeting of the

BudgetTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4378 Accepted: 1679 Special JudgeDescriptionWe are supposed to make a budget proposal for this m

Panic RoomTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1592 Accepted: 789DescriptionYou are the lead programmer for the Securitron 9042, the latest and

Just Another Information Sharing ProblemTime Limit: 2 Seconds      Memory Limit: 65536 KB There is going to be another test in the kindergarten. Again the teacher has already told every kid

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5806 Accepted: 2266DescriptionOn an N × N chessboard with a non-negative number in

做的第一个最小费用流问题，第一次忘了费用乘以流量 WA了一次，每次输入一个矩阵都运行一次最小费用流即可。  #include#include#include#includeusing namespace std; #define INF 0x1f1f1f1f#define MIN(a,b) ((a) int store[60][60];//储量i

#include#include#includeusing namespace std;#define MIN(a,b) (a)<(b)?(a):(b)int m,n;int flow[202][202];int cap[202][202];int e[202];int h[202];void fun(){ //Init memset(flow,0,sizeof(f

#include#include#include#includeusing namespace std;#define MIN(a,b) (a)<(b)?(a):(b)int flow[205][205];int cap[205][205];int lev_net[205][205];int mx[205];bool fl[205];int m,n;int res;

第一个网络流题，虽水还是记念一下，因为忘了将反向边每次更新，无耻的贡献了N次WA~用的是算法导论上的第一个算法，比较慢的Ford_fulkerson,广搜找增广路，每次记录每个节点的前驱节点以到该节点路径中的最小流#include#include#include#includeusing namespace std;int flow[205][205];int cap[205][20

题目：Taxi Cab SchemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4432 Accepted: 1868DescriptionRunning a taxi station is not all that simple. Apart from the obvious demand for

int flow[205][205];int cap[205][205];int m,n;//m表示边数，n表示点数，均从1开始int ford_furkerson(){ int ret=0; bool fl[205]; int pre[205]; int ft[205]; while(1) { memset(fl,0,sizeof(fl)); memset(p