摘要：John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been e 阅读全文

摘要：题目描述 四象树是每个内结点均有4个子结点的特殊四叉树，它可用于描述平面上黑白图像。平面上的黑白图像是32行×32列的正方形，每个格子称为1个象素，是最小的图像单位。正方形图像可分成四个相等的小正方形，可按直角坐标系四个象限的顺序分别编号1，2，3，4，分别对应于四象树的四个子结点。这样，32行×3 阅读全文

摘要：Ranking the Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3301 Accepted: 1511 Description Each of Farmer John's N cows (1 ≤ N ≤ 1,00 阅读全文

摘要：You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key o 阅读全文

摘要：Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 287192 Accepted Submission(s): 68202 Prob 阅读全文