# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320858 | knon0501 | Mountains (IOI17_mountains) | C++14 | 1094 ms | 512 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<bits/stdc++.h>
using namespace std;
long long a[2005];
int dp[2005][2005];
int visit[2005][2005];
int n;
int f(int l,int r){
if(l>r)return 0;
if(l==r)return 1;
if(r==l+1)return 1;
if(visit[l][r])return dp[l][r];
visit[l][r]=0;
int i,j;
for(i=l ; i<=r ; i++){
int k=i-1;
int x=1;
for(int j=i-2 ; j>=l ; j--){
if((a[i]-a[k])*(i-j)>=(a[i]-a[j])*(i-k)){
x+=f(j+1,k-1);
k=j;
}
}
x+=f(l,k-1);
dp[l][r]=max(dp[l][r],x);
}
return dp[l][r];
}
int maximum_deevs(std::vector<int> y) {
n=y.size();
for(int i=1 ; i<=n ; i++)
{
a[i]=y[i-1];
}
return f(1,n);
}
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... |