Submission #575173

#TimeUsernameProblemLanguageResultExecution timeMemory
575173d4xnMountains (IOI17_mountains)C++17
20 / 100
1 ms212 KiB
#pragma GCC optimize ("Ofast") #include "mountains.h" #include <bits/stdc++.h> using namespace std; #define ld long double #define ll long long const int N = 2002; ll n, ans; ll dp[N]; int maximum_deevs(vector<int> y) { n = y.size(); ans = 1; for (ll i = 0; i < n; i++) { dp[i] = 1; for (ll j = 0; j < i; j++) { for (ll k = j+1; k < i; k++) { ld a = i; ld b = j; ld c = k; ld d = y[i]; ld e = y[j]; ld f = y[k]; ld p = (d-e) / (a-b); ld h = e + ((c-b) * p); if (f > h) dp[i] = max(dp[i], dp[j]+1); } } ans = max(ans, dp[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...