「空白」物語

摘要： 1 //KM 邻接矩阵 2 const int INF = 0x3f3f3f3f; 3 4 int n, pay[305][305]; 5 int match[305];//y方点对应的x方点 6 int lx[305], ly[305];//标号 7 int slack[305];//记录标号改变量 8 bool visx[305], visy[305]; 9 10 ... 阅读全文

摘要： 1 //isap 2 struct isap_edge{ 3 int from, to, next, val; 4 }isap_e[MAXM]; 5 6 int isap_cnt, isap_h[MAXN]; 7 8 void isap_init(){ 9 isap_cnt = 0; 10 memset( isap_h, -1, sizeof( is... 阅读全文

摘要： 1 //dijkstra 2 #include 3 #include 4 5 using namespace std; 6 7 const int MAXN = 100; 8 const int MAXM = 10000; 9 //////////////////////////////////////////////// 10 struct dij_edge{ 11 ... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=1273 Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This me 阅读全文

摘要： 题目链接：http://poj.org/problem?id=3169 Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N 阅读全文

摘要： 题目链接：http://poj.org/problem?id=2502 Description You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ri 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4725 Problem Description This is a very easy problem, your task is just calculate el camino mas corto e 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4370 Problem Description Given a n*n matrix Cij (1<=i,j<=n),We want to find a n*n matrix Xij (1<=i,j<=n 阅读全文

摘要： 题目链接：http://poj.org/problem?id=1062 Description 年轻的探险家来到了一个印 第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求 酋长降低要求。酋长说："嗯，如果 阅读全文

摘要： 题目链接：http://poj.org/problem?id=3159 Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher bro 阅读全文