摘要：
kuangbin专题四 ： 最短路 I 题 Arbitrage POJ 2240 Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into mor 阅读全文
摘要：
H - Cow Contest POJ3660 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code b 阅读全文
摘要：
G - MPI Maelstrom POJ1502 BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine 阅读全文
摘要：
A. Theatre Square A. Theatre Square Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion 阅读全文
摘要：
A. Div. 64 Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following: 阅读全文
摘要：
POJ 3259 Wormholes While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is 阅读全文
摘要：
A - BalancePOJ1837 Gigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance.It orders 阅读全文
摘要：
/* 带点更新（累加），求部分线段和 */ /*(1) Add i j,i和j为正整数,表示第i个营地增加j个人（j不超过30） (2)Sub i j ,i和j为正整数,表示第i个营地减少j个人（j不超过30）; (3)Query i j ,i和j为正整数,i #include #define maxn 50010 typedef struct node{ int sum ; ... 阅读全文
摘要：
HDU 1166 敌兵布阵(单点更新，区域查询求和的线段树模板) http://acm.hdu.edu.cn/showproblem.php?pid=1166////////////////////////////////////////////////敌兵布阵Time Limit: 2000/10 阅读全文
摘要：
HDU 1754 I Hate Ithttp://acm.hdu.edu.cn/showproblem.php?pid=1754//////////////////注意线段树 的大小要比 需要使用线段树的数据的个数 大个3到4倍 /////////////////////////////////// 阅读全文