摘要:
Going HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:17230Accepted:8781DescriptionOn a grid map there are n little men and n houses. In eac... 阅读全文
摘要:
Problem Description给你一个n*n的格子的棋盘,每个格子里面有一个非负数。从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取的数所在的2个格子不能相邻,并且取出的数的和最大。Input包括多个测试实例,每个测试实例包括一个整数n 和n*n个非负数(n 2 #inc... 阅读全文
摘要:
Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 6817Accepted Submission(s): 3178Proble... 阅读全文
摘要:
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8431Accepted Submission(s): 3921Pr... 阅读全文