| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357468 | toast12 | Mountains (IOI17_mountains) | C++20 | 0 ms | 344 KiB |
#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;
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++) {
dp[i] = max(dp[i], dp[i-1]);
long double mx = -1e18;
mx = max(mx, (long double)(v[i+1]-v[i]));
for (int j = i+2; j <= n; j++) {
long double x = v[j]-v[i];
x /= (long double)(j-i);
if (x < mx) dp[j] = max(dp[j], dp[i]+1);
mx = max(mx, x);
}
}
return dp[n];
}| # | 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... | ||||
