제출 #1357468

#제출 시각아이디문제언어결과실행 시간메모리
1357468toast12Mountains (IOI17_mountains)C++20
20 / 100
0 ms344 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...