Codeforces Round #267 (Div. 2) C. George and Job(DP)补题
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:
[l1, r1], [l2, r2], ..., [lk, rk] (1 ≤ l1 ≤ r1 < l2 ≤ r2 < ... < lk ≤ rk ≤ n; ri - li + 1 = m),
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
#include <iostream>
#include <cstdio>
#define LL long long
using namespace std;
const int maxn = + ;
LL p[maxn],s[maxn],dp[maxn][maxn];
int main(){
int n,m,k;
cin>>n>>m>>k;
for(int i = ;i <= n;i++){
cin>>p[i];s[i] = s[i - ] + p[i];
}
for(int i = m;i <= n;i++)
for(int j = ;j <= k;j++)
dp[i][j] = max(dp[i-m][j-]+s[i]-s[i-m],dp[i-][j]);
cout<<dp[n][k]<<endl;
return ;
}
最新文章
- UV动画
- .net core 产品开发问题记录
- angular源码分析:$compile服务——指令的编写
- 使用MyBatis对表执行CRUD操作
- 使用Cordova编译Android平台程序提示:Could not reserve enough space for 2097152KB object heap
- android Dialog重绘
- C# Bitmap 复制
- 使用HtmlAgilityPack解析Html(非常好用)
- 更改MySql表和字段区分大小写
- UIKit,Core Data , Core Graphics, Core Animation,和OpenGLES框架
- ExecutorService.invokeAny()和ExecutorService.invokeAll()的使用剖析
- Boolean类源码分析
- 【SSRS】入门篇(一) -- 创建SSRS项目
- ueditor浏览器 无法上传文件.问题
- php中memcache的运用
- __import__
- 焦作网赛-G-欧拉降幂
- 2019.01.26 codeforces 528D. Fuzzy Search(fft)
- 华为手机使用objectAnimation异常
- node.js模块依赖及版本号