oj.uz

답안 #127028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127028 2019-07-08T20:05:38 Z AQT 수열 (APIO14_sequence) C++14
0 / 100
 45 ms 31240 KB 
#include <bits/stdc++.h>

using namespace std;

int N, K;
long long pre[100005];
long long dp[100005][25];
int par[100005][25];
deque<int>dq;
vector<int> v;

double f(int idx1, int idx2, int lvl){
    return 1.0*(dp[idx1][lvl]-dp[idx2][lvl]-pre[idx1]*pre[idx1]+pre[idx2]*pre[idx2])/(pre[idx2]-pre[idx1]);
}

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K;
    for(int i = 1; i<=N; i++){
        cin >> pre[i];
        if(pre[i]){
            v.push_back(i);
        }
        pre[i] += pre[i-1];
    }
    for(int k = 1; k<=K; k++){
        dq.push_back(k);
        for(int i = k+1; i<=N; i++){
            while(dq.size() >= 2){
                if(f(dq[0], dq[1], k-1) < pre[i]){
                    dq.pop_front();
                }
                else{
                    break;
                }
            }
            dp[i][k] = dp[dq.front()][k-1] + pre[dq.front()]*(pre[i]-pre[dq.front()]);
            par[i][k] = dq.front();
            //cout << i << " " << k << " " << dp[i][k] << " " << par[i][k] << endl;
            while(dq.size() >= 2){
                if(f(dq[dq.size()-2], dq.back(), k-1) > f(dq.back(), i, k-1)){
                    dq.pop_back();
                }
                else{
                    break;
                }
            }
            dq.push_back(i);
        }
        dq.clear();
    }
    cout << dp[N][K] << "\n";
    vector<int> v;
    int crnt = N;
    for(int k = K; k>=1; k--){
        v.push_back(par[crnt][k]);
        crnt = par[crnt][k];
    }
    sort(v.begin(), v.end());
    for(int n : v){
        cout << n << " ";
    }
    cout << "\n";
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 252 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 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 0 < 1
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 252308 < 1093956
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 484133 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 632 KB contestant didn't find the optimal answer: 395622 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 3448 KB contestant didn't find the optimal answer: 1187850 < 1818678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 31240 KB contestant didn't find the optimal answer: 5054352 < 19795776960
2 Halted 0 ms 0 KB -