제출 #660396

#제출 시각아이디문제언어결과실행 시간메모리
660396leroycut수열 (APIO14_sequence)C++17
50 / 100
2092 ms53080 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; const int N = 1e5 + 3; const ll INF = 2e12 + 3; int n, k; ll dp[N][203], p[N], ppm[N]; ld cross(int i, int j, int c){ ld rb = (dp[j][c - 1] - p[j] * p[j]) - (dp[i][c - 1] - p[i] * p[i]); ld rk = p[i] - p[j]; return rb / rk; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for(int i = 1; i <= n; ++i){ ll a; cin >> a; p[i] = p[i - 1] + a; } for(int j = 1; j <= k; ++j){ for(int i = j + 1; i <= n; ++i){ for(int t = 1; t < i; ++t){ dp[i][j] = max(dp[i][j], dp[t][j - 1] + p[t] * (p[i] - p[t])); } } } cout << dp[n][k] << "\n"; int poi = n - 1, end = n, cnt = k - 1; for(; poi >= 1 && cnt >= 0; --poi){ if(dp[poi][cnt] + p[poi] * (p[end] - p[poi]) == dp[end][cnt + 1]){ cout << poi << " "; end = poi; cnt--; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...