| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357471 | toast12 | Mountains (IOI17_mountains) | C++20 | 1 ms | 344 KiB |
#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int maximum_deevs(vector<int> y) {
int n = y.size();
vector<int> v(1);
for (int i = 0; i < n; i++) v.push_back(y[i]);
vector<int> dp(n+1, 1);
for (int i = 1; i < n; i++) {
ll a = v[i+1]-v[i];
ll b = 1;
for (int j = i+2; j <= n; j++) {
ll c = v[j]-v[i];
ll d = j-i;
if (a*d > c*b) dp[j] = max(dp[j], dp[i]+1);
else {
a = c;
b = d;
}
}
}
return *max_element(dp.begin(), dp.end());
}| # | 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... | ||||
