# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48030 | E869120 | 수열 (APIO14_sequence) | C++14 | 426 ms | 67812 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long N, K, A[100009], S;
pair<long long, long long>dp[10009][209];
int main() {
cin >> N >> K; K++;
for (int i = 1; i <= N; i++) { cin >> A[i]; S += A[i]; }
for (int i = 1; i <= N; i++) A[i] += A[i - 1];
for (int i = 0; i <= N; i++) { for (int j = 0; j <= K; j++) dp[i][j] = make_pair((1LL << 60), -1); }
dp[0][0] = make_pair(0, -1);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= K; j++) {
for (int k = i - 1; k >= 0; k--) {
long long D = dp[k][j - 1].first + (A[i] - A[k])*(A[i] - A[k]);
if (dp[i][j].first > D) {
dp[i][j].first = D;
dp[i][j].second = k;
}
else if (j >= 2) {
break;
}
}
}
}
vector<int>C; int cx = N, cy = K;
while (cx >= 1) {
if (cx != N) C.push_back(cx);
cx = dp[cx][cy].second; cy--;
}
reverse(C.begin(), C.end());
cout << (S*S - dp[N][K].first) / 2 << endl;
for (int i = 0; i < C.size(); i++) { if (i)cout << " "; cout << C[i]; }cout << endl;
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |