F1. Pictures with Kittens (easy version)【暴力】
F1. Pictures with Kittens (easy version)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
The only difference between easy and hard versions is the constraints.
Vova likes pictures with kittens. The news feed in the social network he uses can be represented as an array of nn consecutive pictures (with kittens, of course). Vova likes all these pictures, but some are more beautiful than the others: the ii-th picture has beauty aiai.
Vova wants to repost exactly x pictures in such a way that:
- each segment of the news feed of at least kk consecutive pictures has at least one picture reposted by Vova;
- the sum of beauty values of reposted pictures is maximum possible.
For example, if k=1 then Vova has to repost all the pictures in the news feed. If k=2 then Vova can skip some pictures, but between every pair of consecutive pictures Vova has to repost at least one of them.
Your task is to calculate the maximum possible sum of values of reposted pictures if Vova follows conditions described above, or say that there is no way to satisfy all conditions.
Input
The first line of the input contains three integers n,kn,k and xx (1≤k,x≤n≤200) — the number of pictures in the news feed, the minimum length of segment with at least one repost in it and the number of pictures Vova is ready to repost.
The second line of the input contains nn integers a1,a2,…,an(1≤ai≤109), where aiai is the beauty of the ii-th picture.
Output
Print -1 if there is no way to repost some pictures to satisfy all the conditions in the problem statement.
Otherwise print one integer — the maximum sum of values of reposted pictures if Vova follows conditions described in the problem statement.
Examples
input
5 2 3 5 1 3 10 1
output
18
input
6 1 5 10 30 30 70 10 10
output
-1
input
4 3 1 1 100 1 1
output
100
題意：
滿足任意連續的k個數至少有一個選中，問選中x個的最大值，如果不存在輸出-1，否則輸出最大值
分析：
dp[i][k]代表前i個數中選k個的最大值，此時選擇的最後一個數是a[i]
程式碼：
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll a[210005];
ll dp[250][250];
int main()
{
ll i,j,k,l,n,x,tt;
scanf("%lld%lld%lld",&n,&k,&x);
for(i=1;i<=n;i++)
scanf("%lld",&a[i]);
memset(dp,-mod,sizeof(dp));
dp[0][0]=0;
for(i=1;i<=n;i++)
{
tt=0;
tt=max(i-k,tt);
for(j=i-1;j>=tt;j--)
{
for(l=0;l<x;l++)
dp[i][l+1]=max(dp[i][l+1],dp[j][l]+a[i]);
}
}
ll maxn;
maxn=-1;
for(i=n;i>n-k;i--)
maxn=max(maxn,dp[i][x]);
printf("%lld\n",maxn);
}