# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
700214 | kioto2 | K blocks (IZhO14_blocks) | C++14 | 17 ms | 2244 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
#define int long long
using namespace std;
const int N=1e5+10;
int a[N],n,k,f[110][110];
signed main()
{
cin.tie(0)->ios_base::sync_with_stdio(0);
if(fopen("task.inp","r"))
{
freopen("task.inp","r",stdin);
freopen("task.out","w",stdout);
}
cin>>n>>k;
fori(i,1,n) cin>>a[i];
memset(f,50,sizeof(f));
f[0][0]=0;
fori(i,1,n)
{
int val=0;
ford(j,i,1)
{
val=max(val,a[j]);
fori(t,1,k)
{
f[i][t]=min(f[i][t],f[j-1][t-1]+val);
}
}
}
cout<<f[n][k];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |