oj.uz

답안 #477481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477481 2021-10-02T09:21:42 Z PiejanVDC 수열 (APIO14_sequence) C++17
0 / 100
 2000 ms 15948 KB 
#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,k; cin>>n>>k;
    vector<int>pref(n+1);
    pref[0]=0;
    for(int i = 0 ; i < n ; i++) {
        int x; cin>>x;
        pref[i+1] = pref[i] + x;
    }
    int res[n+1][k+1];
    int dp[n+1][k+1];
    for(int i = 0 ; i <= n ; i++)
        dp[i][0] = 0;
    for(int i = 1 ; i <= k ; i++)
        dp[0][i] = 0;
    for(int i = 1 ; i <= k ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            dp[j][i] = 0;
            for(int c = 1 ; c < j ; c++) {
                if(dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]) > dp[j][i]) {
                    res[j][i] = c;
                }
                dp[j][i] = max(dp[j][i],dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]));
            }
        }
    }
    int mx=0;
    vector<int>ans;
    int node;
    for(int i = 0 ; i <= n ; i++) {
        if(dp[i][k] > mx) {
            mx=dp[i][k];
            node = i;
        }
    }
    cout << mx << "\n";
    for(int i = 0 ; i < k ; i++) {
        assert(node > 0);
        ans.push_back(node);
        node = res[node][k - i];
    }
    for(int i = 0 ; i < k ; i++)
        cout << --ans[i] << " ";
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 204 KB contestant found the optimal answer: 999 == 999
3 Runtime error 1 ms 332 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 204 KB contestant found the optimal answer: 302460000 == 302460000
3 Runtime error 1 ms 460 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 204 KB contestant found the optimal answer: 311760000 == 311760000
3 Runtime error 9 ms 972 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 204 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 204 KB contestant found the optimal answer: 140412195 == 140412195
3 Runtime error 193 ms 3512 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 628 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 207 ms 588 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2098 ms 15948 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2094 ms 3788 KB Time limit exceeded
2 Halted 0 ms 0 KB -