Investment Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5362 Accepted: 1843…
POJ 3159 Candies(差分规划+SPFA)
Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 18737 Accepted: 4930 Descrip…
POJ 1860 Currency Exchange(BellmanFord算法的变形,求正环)
/* POJ 1860 有多种汇币,汇币之间可以交换,这需要手续费,当你用100A币 交换B币时,A到B的汇率是29.75,手续费是0.39,那么你可以得到 (100 - 0.39) * 29.75 = 2963.397…
POJ 3255 Wormholes(最短路最负环)
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20639 Accepted: 7342 Descri…
POJ 1062 昂贵的聘礼(最短路Dijkstra)
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27365 Accepted: 7639 Descriptio…
POJ 2253 Frogger(最短路的变形)
Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17842 Accepted: 5818 Descript…
POJ 1125 Stockbroker Grapevine(任意两点的最短路,FLoyed 算法)
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21124 Accepted:…
POJ 2240 Arbitrage(求正环)
Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11008 Accepted: 4629…
POJ 1511 Invitation Cards(最短路)
Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 14556 Accept…
POJ 3041 Asteroids(二分匹配模板题)
Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10288 Accepted: 5556 Descri…
POJ 3020 Antenna Placement(二分图匹配)
Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4739 Accepted: 2359…
POJ 3692 Kindergarten(二分图匹配)
Kindergarten Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3866 Accepted: 1832 Desc…