# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125274 | dragonslayerit | Mountains (IOI17_mountains) | C++14 | 42 ms | 28024 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 "mountains.h"
#include <vector>
#include <algorithm>
#include <cstdio>
int first[2001][2001];//if i is required
int best[2001][2001];
//Is there a case that breaks the algorithm assuming first=best?
int maximum_deevs(std::vector<int> y) {
for(int i=0;i<y.size();i++){
first[i][i+1]=1;
best[i][i+1]=1;
}
for(int i=y.size()-1;i>=0;i--){
int k=i+1;
for(int j=i+2;j<=y.size();j++){
first[i][j]=first[i][k]+best[k+1][j];
best[i][j]=std::max(first[i][j],best[i+1][j]);
if(1LL*(k-i)*(y[j]-y[i])>=1LL*(j-i)*(y[k]-y[i])){
k=j;
}
}
}
return best[0][y.size()];
}
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... |