1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 250005
#define nm 10000005
#define pi 3.1415926535897931
using namespace std;
const ll inf=1e18;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,m,a[NM];
ll d[NM][10][10][3],ans;
inline void upd(ll&x,ll y){x=min(x,y);}
int main(){
n=read();m=read();
inc(i,1,n)a[i]=read();
inc(i,1,n+1)inc(j,0,m)inc(k,0,m)inc(v,0,2)d[i][j][k][v]=inf;
d[1][0][0][1]=0;
inc(i,1,n)inc(j,0,m)inc(k,0,m)inc(v,0,2)if(d[i][j][k][v]<inf){
upd(d[i+1][j][k][0],d[i][j][k][v]+a[i]);
if(v<2)upd(d[i+1][j][k][v+1],d[i][j][k][v]);
if(j<m)upd(d[i+1][j+1][k][0],d[i][j][k][v]);
if(v<2&&k<m)upd(d[i+1][j][k+1][v+1],d[i][j][k][v]+a[i]);
}
ans=inf;
inc(j,0,m)ans=min(ans,d[n+1][j][j][1]);
inc(j,0,m)ans=min(ans,d[n+1][j][j][0]);
printf("%lld\n",ans);
return 0;
}
|
