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 <bits/stdc++.h>
using namespace std;
#define ld long double
const int N = 2002;
int n, ans;
int dp[N];
int maximum_deevs(vector<int> y) {
n = y.size();
ans = 1;
for (int i = 0; i < n; i++) {
dp[i] = 1;
for (int j = i-1; j >= 0; j--) {
for (int k = j+1; k < i; k++) {
ld p = (y[i]-y[j]) / (i-j);
ld h = y[j] + ((k-j) * p);
ld h2 = y[k];
if (h2 > h) dp[i] = max(dp[i], dp[j]+1);
}
}
ans = max(ans, dp[i]);
}
return ans;
}
# | 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... |