oj.uz

답안 #140857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140857 2019-08-05T19:31:55 Z silxikys 수열 (APIO14_sequence) C++14
50 / 100
 256 ms 3064 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1005, maxk = 205;
int N, K, a[maxn];

ll pre[maxn];
ll dp[maxn][maxk];
int previous[maxn][maxk];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> K;
    for (int i = 1; i <= N; i++) {
        cin >> a[i];
        pre[i] = a[i] + pre[i-1];
    }
    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= K; k++) {
            pair<ll,int> best = {0,0};
            for (int j = 1; j < i; j++) {
                //cout << i << ' ' << k << ' ' << j << endl;
                best = max(best,{dp[j][k-1]+(pre[i]-pre[j])*(pre[j]),j});
            }
            dp[i][k] = best.first;
            previous[i][k] = best.second;
        }
    }
    //output
    cout << dp[N][K]<< '\n';
    int curr = N;
    int k = K;
    vector<int> ans;
    while (k > 0) {
        curr = previous[curr][k];
        k--;
        ans.push_back(curr);
    }
    reverse(ans.begin(),ans.end());
    for (int i: ans) {
        cout << i << ' ';
    }
    cout << '\n';
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 504 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 380 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 504 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 504 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 504 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 508 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 504 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 504 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 504 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 760 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 11 ms 888 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 3 ms 1016 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 8 ms 760 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 10 ms 888 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 11 ms 760 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 4 ms 760 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 4 ms 888 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 5 ms 888 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2808 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 7 ms 2808 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 249 ms 2800 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 8 ms 2808 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 252 ms 2780 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 217 ms 3064 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 242 ms 2736 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 256 ms 2896 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 56 ms 2808 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 106 ms 2780 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Integer 0 violates the range [1, 9999]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -