# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125267 | dragonslayerit | Mountains (IOI17_mountains) | C++14 | 123 ms | 29944 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 memo[2001][2001];
int last[2001][2001];
int solve(int begin,int end){
if(begin==end) return 0;
if(end-begin==1) return 1;
if(memo[begin][end]!=-1) return memo[begin][end];
int ans=solve(begin,last[begin][end-1])+solve(last[begin][end-1]+1,end);
return memo[begin][end]=std::max(ans,solve(begin+1,end));
}
int maximum_deevs(std::vector<int> y) {
for(int i=0;i<=y.size();i++){
for(int j=0;j<=y.size();j++){
memo[i][j]=-1;
}
}
for(int i=0;i<y.size();i++){
int k=i+1;
for(int j=i+1;j<y.size();j++){
if(1LL*(k-i)*(y[j]-y[i])>=1LL*(j-i)*(y[k]-y[i])){
k=j;
}
last[i][j]=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... |