oj.uz

답안 #573566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573566 2022-06-06T21:04:12 Z danikoynov Feast (NOI19_feast) C++14
21 / 100
 1000 ms 10556 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2010;

int n, k;
ll a[maxn], dp[maxn][maxn], par[maxn];
void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i ++)
        cin >> a[i], par[i] = par[i - 1] + a[i];

    ll ans = 0;
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= k; j ++)
    {
        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        for (int i1 = 1; i1 <= i; i1 ++)
        {
            dp[i][j] = max(dp[i][j], dp[i1 - 1][j - 1] + par[i] - par[i1 - 1]);
        }
        ans = max(ans, dp[i][j]);
    }

    cout << ans << endl;

}

int main()
{
    solve();
    return 0;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 564 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 4 ms 1492 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 4 ms 1492 KB Output is correct
16 Correct 2 ms 1364 KB Output is correct
17 Correct 6 ms 1456 KB Output is correct
18 Correct 1 ms 1340 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 564 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 4 ms 1492 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 4 ms 1492 KB Output is correct
16 Correct 2 ms 1364 KB Output is correct
17 Correct 6 ms 1456 KB Output is correct
18 Correct 1 ms 1340 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Execution timed out 1081 ms 10556 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -