2013年8月15日

HDU 4678 Mine （2013多校8 1003题 博弈）

摘要： MineTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 51Accepted Submission(s): 6Problem DescriptionHave you ever played a game in Windows: Mine?This game is played on a n*m board, just like the Pic(1)On the board, Under some grids there are mines (r 阅读全文

posted @ 2013-08-15 17:12 kuangbin 阅读(1075) 评论(0) 推荐(0)

HDU 4679 Terrorist’s destroy (2013多校8 1004题 树形DP)

摘要： Terrorist’s destroyTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 6Problem DescriptionThere is a city which is built like a tree.A terrorist wants to destroy the city's roads. But now he is alone, he can only destroy 阅读全文

posted @ 2013-08-15 17:09 kuangbin 阅读(1098) 评论(6) 推荐(1)

HDU 4681 String（2013多校8 1006题 DP）

摘要： StringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 11Accepted Submission(s): 4Problem DescriptionGiven 3 strings A, B, C, find the longest string D which satisfy the following rules:a) D is the subsequence of Ab) D is the subsequence of Bc) C is 阅读全文

posted @ 2013-08-15 17:06 kuangbin 阅读(782) 评论(0) 推荐(0)

1036: [ZJOI2008]树的统计Count （树链剖分）

摘要： 1036: [ZJOI2008]树的统计CountTime Limit:10 SecMemory Limit:162 MBSubmit:3401Solved:1418[Submit][Status]Description一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 III. QSUM u v: 询问从点u到点v的路径上的节点的权值和 注意：从点u到点v的路径上的节点包括u和v本身Input输入的第一行为一个 阅读全文

posted @ 2013-08-15 10:25 kuangbin 阅读(3102) 评论(0) 推荐(1)

导航

JAVASCRIPT: