oj.uz

Submission #869335

# Submission time Handle Problem Language Result Execution time Memory
869335 2023-11-04T05:02:50 Z JellyTheOctopus Mean (info1cup19_mean) C++17
0 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

const int MOD = 1e9+7;

int N;
long long arr[201];
long long DP[201][201];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> N;
    for (int i = 1; i <= N; i++) {
        cin >> arr[i];
        DP[i][1] = arr[i];
    }
    for (int i = 2; i <= N; i++) {
        for (int j = 2; j <= i; j++) {
            DP[i][j] = max(DP[i][j], (DP[i][j-1]+arr[i-j+1])/2);
        }
        for (int j = 2; j <= i; j++) {
            DP[i][i] = max(DP[i][i], (DP[i][j-1]+DP[i-j+1][i-j+1])/2);
        }
    }
    cout << DP[N][N] << "\n";
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -