标签：style blog http color io os ar for sp
Codeforces Round #267 (Div. 2) C. George and Job题目链接请点击~
The new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn‘t have enough money, so George was going to work as a programmer. Now he faced the following problem at the work.
Given a sequence of n integers p1, p2, ..., pn. You are to choose k pairs of integers:
in such a way that the value of sum 
is maximal possible. Help George to cope with the task.
The first line contains three integers n, m and k (1 ≤ (m × k) ≤ n ≤ 5000). The second line contains n integersp1, p2, ..., pn (0 ≤ pi ≤ 109).
Print an integer in a single line — the maximum possible value of sum.
5 2 1 1 2 3 4 5
9
7 1 3 2 10 7 18 5 33 0
61
1 #include <iostream> 2 #include <cstdio> 3 #define LL long long 4 using namespace std; 5 const int maxn = 5000 + 100; 6 LL p[maxn],s[maxn],dp[maxn][maxn]; 7 int main(){ 8 int n,m,k; 9 cin>>n>>m>>k; 10 for(int i = 1;i <= n;i++){ 11 cin>>p[i];s[i] = s[i - 1] + p[i]; 12 } 13 for(int i = m;i <= n;i++) 14 for(int j = 1;j <= k;j++) 15 dp[i][j] = max(dp[i-m][j-1]+s[i]-s[i-m],dp[i-1][j]); 16 cout<<dp[n][k]<<endl; 17 return 0; 18 }
Codeforces Round #267 (Div. 2) C. George and Job（DP）补题
标签：style blog http color io os ar for sp
原文地址：http://www.cnblogs.com/jusonalien/p/4006445.html
