2013年5月29日

MUTC 1 A - Divide Chocolate 方案统计DP

摘要： Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1271Accepted Submission(s): 604Problem DescriptionIt is well known that claire likes dessert very much, especially chocolate. But as a girl she also focuses on the intake of calories e 阅读全文

posted @ 2013-05-29 10:49 电子幼体 阅读(195) 评论(0) 推荐(0) 编辑

MUTC 1 D - Matrix 线性代数 网络流

摘要： MatrixTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 825Accepted Submission(s): 212Problem DescriptionLet A be a 1*N matrix, and each element of A is either 0 or 1. You are to find such A that maximize D=(A*B-C)*AT, where B is a given N*N matrix w 阅读全文

posted @ 2013-05-29 08:03 电子幼体 阅读(185) 评论(0) 推荐(0) 编辑

白书上的Dinic模板

摘要： #include #include #include #include #include #include #include #include #include #include using namespace std; const int maxn=1111; const int maxm=1111111; const int INF=1e9; struct Edge{ int from,to,cap,flow; }; struct Dinic{ int n,m,s,t; vectoredges; vectorG[maxn]; ... 阅读全文

posted @ 2013-05-29 07:12 电子幼体 阅读(125) 评论(0) 推荐(0) 编辑

导航