# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125260 | dragonslayerit | Mountains (IOI17_mountains) | C++14 | 15 ms | 2424 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* base;
int memo[500][500];
int solve(int* begin,int* end){
if(begin==end) return 0;
if(memo[begin-base][end-base]!=-1) return memo[begin-base][end-base];
int ans=1;
std::vector<int*> sub;
for(auto it=begin+1;it!=end;it++){
sub.push_back(it);
}
std::stable_sort(sub.begin(),sub.end(),[begin](int* a,int* b){return (a-begin)*(*b-*begin)>(b-begin)*(*a-*begin);});
std::reverse(sub.begin(),sub.end());
int* last=end;
for(int* it:sub){
if(it>last) continue;
ans+=solve(it+1,last);
last=it;
}
return memo[begin-base][end-base]=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;
}
}
base=y.data();
return solve(y.data(),y.data()+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... |