oj.uz

답안 #543644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543644 2022-03-31T06:38:07 Z tudor Mean (info1cup19_mean) C++17
100 / 100
 3 ms 340 KB 
#include <iostream>

using namespace std;
const int nmax = 200;

int dp[nmax + 1][nmax + 1];

int main() {
    int n;
    cin >> n;
    for ( int i = 1; i <= n; i++ )
        cin >> dp[i][i];
    for ( int i = 2; i <= n; i++ ) /// lungimea
        for ( int j = 1; j <= n - i + 1; j++ ) {
            int maxy = 0;
            for ( int k = j; k < i + j - 1; k++ )
                maxy = max ( maxy, ( dp[j][k] + dp[k + 1][i + j - 1] ) / 2 );
            dp[j][i + j - 1] = maxy;
        }
    cout << dp[1][n];

    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct