#218. 前缀和

搞笑题嘿嘿嘿

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define per(i,j,k) for(i=j;i>=k;--i)
#define ll long long
#define db double
#define mkp(x,y) make_pair(x,y)
#define pii pair<int,int>
#define X first
#define Y second
const int inf=150000000;
int n,k,s,a[151],f[2][151][5626],ans; 
int main(){
	int h,i,j,rg;
	scanf("%d%d%d",&n,&k,&s);
	s=min(n*n/4,s);
	rep(i,1,n)scanf("%d",&a[i]);
	rep(i,1,n){
		memset(f[i&1],0,sizeof f[i&1]);
		rg=min(k,i);
		rep(j,1,rg){
			rep(h,0,s){
				f[i&1][j][h]=h<i-j?inf:f[i&1^1][j-1][h+j-i]+a[i];
				if(i>j&&f[i&1^1][j][h]<f[i&1][j][h])
					f[i&1][j][h]=f[i&1^1][j][h];
			}
		}
	}
	ans=f[n&1][k][0];
	rep(i,1,s)ans=min(f[n&1][k][i],ans);
	printf("%d\n",ans);
	return 0;
}