제출 #48689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48689		faishol27	수열 (APIO14_sequence)	C++14	71 / 100	2066 ms	85432 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<ll, ll> pl;
typedef pair<int, int> pi;
 
#define fi first
#define se second
 
const int MAXN = 1e5+5;
const int MAXK = 205;

int N, K;
ll data[MAXN], pref[MAXN], suff[MAXN];
ll dp[2][MAXN], ans=0;
int tambah[MAXK][MAXN];
stack<int>putus;

void init(){
    memset(data, 0, MAXN);
    memset(pref, 0, MAXN);
    memset(suff, 0, MAXN);
    memset(dp, -1, sizeof dp);
    memset(tambah, -1, sizeof tambah);

    for(int i=0;i<MAXN;i++) dp[0][i] = 0, tambah[0][i] = 0;
//    for(int i=0;i<MAXK;i++) dp[i][0] = 0, tambah[i][0] = 0;
}

void bruteforce(int posK, int ind){
    int now = posK&1,
        bef = now^1;
    //cout << posK << " " << ind << ": ";
    for(int l=posK-1;l<ind;l++){
        ll tmp = dp[bef][l]+(pref[ind]-pref[l])*suff[ind+1];
        //cout << tmp << " ";
        if(dp[now][ind] <= tmp){
            dp[now][ind] = tmp;
            tambah[posK][ind] = l;
        }
    }
    //cout << endl;
}

void bruteforce_search(int posK, int ind, int l, int r){
    //cout << posK << " " << ind << ": ";
    int now = posK&1,
        bef = now^1;
    for(;l<=r;l++){
        ll tmp = dp[bef][l]+(pref[ind]-pref[l])*suff[ind+1];
        //cout << tmp << " ";
        if(dp[now][ind] <= tmp){
            dp[now][ind] = tmp;
            tambah[posK][ind] = l;
        }
    }
    //cout << endl;
}

void ternary_search_max(int posK, int ind){
    int l = posK-1,
        r = ind-1,
        m_ans = l;
    int now = posK&1,
        bef = now^1;

    while(l <= r){        
        if(r-l <= 300){
            bruteforce_search(posK, ind, l, r);
            break;
        }

        ll  m1 = l + (r-l)/3,
            m2 = r - (r-l)/3;

//        cout << posK << " " << ind << ": " << m1 << " " << m2 << endl;
        
        ll  res1 = dp[bef][m1]+(pref[ind]-pref[m1])*suff[ind+1],
            res2 = dp[bef][m2]+(pref[ind]-pref[m2])*suff[ind+1];
        
        if(res1 > res2){
            r = m2-1;
            m_ans = m1;
        }else{
            l = m1+1;
            m_ans = m2;
        }
    }
    
//    cout <<  posK << " " << ind << ": " << m_ans << endl;
    
//    dp[posK][ind] = dp[posK-1][m_ans]+(pref[ind]-pref[m_ans])*suff[ind+1];
//    tambah[posK][ind] = m_ans;
}

int main(){
    init();

    cin >> N >> K;
    
    for(int i=1;i<=N;i++){
        cin >> data[i];
        pref[i] = data[i]+pref[i-1];
    }
    
    for(int i=N;i>0;i--){
        suff[i] = suff[i+1]+data[i];
    }
   
    for(int j=1;j<N;j++){
        ll tmp = pref[j]*suff[j+1];
        //cout << j << " " << tmp << endl;    
        if(dp[1][j] <= tmp){
            dp[1][j] = tmp;
            tambah[1][j] = 0;
        }
    }
    
    for(int i=2; i<=K; i++){
        for(int j=1;j<N;j++){
            if(j < i) continue;
            
            if(abs(i-j) > 300) ternary_search_max(i, j);
            else bruteforce(i, j);
        }
    }

    int now = K&1;
    for(int i=1;i<N;i++) ans = max(ans, dp[now][i]);
    
    int nxt,
        cnt = K;
    for(int i=N-1;i>0;i--){
        if(ans == dp[now][i]){
            putus.push(i);
            nxt = tambah[cnt][i];
            cnt--;
            break;
        }
    }
    while(nxt != 0){
        putus.push(nxt);
        nxt = tambah[cnt][nxt];
        cnt--;
    }
/*
    for(int i=1;i<=K;i++){
        for(int j=1;j<N;j++) cout << tambah[i][j] << " ";
        cout << endl;
    }
*/
    cout << ans << endl;
    
    cout << putus.top();
    putus.pop();
    while(!putus.empty()){
        cout << " " << putus.top();
        putus.pop();
    }
    cout << endl;
 
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'void ternary_search_max(int, int)':
sequence.cpp:64:9: warning: variable 'm_ans' set but not used [-Wunused-but-set-variable]
         m_ans = l;
         ^~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 17 / 17
• Subtask 5: 21 / 21
• Subtask 6: 0 / 29