# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420706 | rama_pang | Cigle (COI21_cigle) | C++17 | 324 ms | 98400 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 <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<vector<int>> dp(N, vector<int>(N));
for (int mid = N - 1; mid >= 1; mid--) {
for (int i = N - 1; i >= mid; i--) {
if (i + 1 < N) {
dp[mid][i] = max(dp[mid][i], dp[mid][i + 1]);
}
if (mid + 1 < N) {
dp[mid][i] = max(dp[mid][i], dp[mid + 1][i]);
}
}
// [mid - 1, mid] as splitting point
int sumLft = 0;
int sumRgt = 0;
int cost = 0;
int ptr = mid;
# | 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... |