# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39304 | 2018-01-11T05:43:30 Z | MrPlany | K blocks (IZhO14_blocks) | C++14 | 1000 ms | 45032 KB |
#include <bits/stdc++.h> using namespace std; int n, a[100109], dp[109][100109], k; int main(){ scanf("%d%d",&n,&k); // if(n>100) return 0; for(int i=1;i<=n;i++) scanf("%d",a+i); for(int i=1;i<=n;i++) dp[1][i] = max(dp[1][i-1], a[i]); for(int i=2;i<=n;i++){ for(int j=i;j<=n;j++){ long long mx = 0, mn=1e9; for(int f = j; f>=i; f--){ mx = max(mx, (long long)a[f]); mn= min( mx + dp[i-1][f-1], mn ); } dp[i][j] = mn; } } for(int i=1;i<=k;i++){ for(int j=1;j<=n;j++){ cout << dp[i][j] << " "; } cout << endl; } cout << dp[k][n]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 45032 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 45032 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 45032 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1000 ms | 45032 KB | Execution timed out |
2 | Halted | 0 ms | 0 KB | - |