# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
94025 |
2019-01-14T18:20:33 Z |
brcode |
None (JOI16_ho_t1) |
C++14 |
|
3 ms |
508 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const long long MAXN = 100010;
long long arr[MAXN];
long long dp[MAXN];
long long n,m,k;
long long rec(long long x,long long y,long long z){
if(x>=n){
return 0;
}
if(dp[x]){
return dp[x];
}
long long maxo = arr[x];
long long mino = arr[x];
long long ans = 1000000000;
for(long long i=x;i<min(n,x+y);i++){
//long long incto = i+x;
maxo = max(maxo,arr[i]);
mino = min(mino,arr[i]);
long long diff = maxo-mino;
long long cost = z+(i-x+1)*diff;
long long final = cost + rec(i+1,y,z);
ans = min(final,ans);
}
return dp[x] = ans;
}
int main() {
cin>>n>>m>>k;
for(long long i=0;i<n;i++){
cin>>arr[i];
}
cout<<rec(0,m,k)<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
508 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |