2012年8月8日
hdu 4340 Capturing a country（树形 dp） （2012 Multi-University Training Contest 5 ）
摘要： Capturing a country Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 380Accepted Submission(s): 164Problem DescriptionAnt and Bob two army want to capture a country. The country is consist of N cities. To capture the city i, it takes Ant A[i] minu. 阅读全文
posted @ 2012-08-08 22:01 Szz 阅读(325) 评论(0) 推荐(0)