新月

There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the groun

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5856    Accepted Submission(s): 2507Problem DescriptionArthur and his sister Carol

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4601    Accepted Submission(s): 2609Problem DescriptionStan and Ollie play the gam

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7315    Accepted Submission(s): 4708Problem Description大学英语四级考试就要来临了，你是不是在紧张的复习？也许

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6033    Accepted Submission(s): 3598Problem Description一年在外 父母时刻牵挂春节回家 你能做几天好孩子吗

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3455    Accepted Submission(s): 2041Problem DescriptionAdam and Eve enter this yea

题目：点击打开链接题意：两个人做游戏，共有n个数，每个人可以任选一端取任意多连续的数，问两个人都想拿最多的情况下，先手最多比后手多拿多少分数。思路：这题一开始想到的是用dp[i][j]表示区间[i,j]内先手最多比后手多拿多少分数，那么状态转移方程为dp[i][j]=max(sum[j]-sum[i-1],dp[i][j],sum[k]-sum[i-1]-dp[k+1][j],sum[j]