제출 #685302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685302		PoonYaPat	수열 (APIO14_sequence)	C++14	89 / 100	916 ms	83048 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,k,ans[100001][201];
ll qs[100001],dp[100001][2];

struct line {
    int ord;
    ll con,slope;
};

deque<line> dq;

double ins(line a, line b) {
    return (double)(b.con-a.con)/(a.slope-b.slope);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>k;
    for (int i=1; i<=n; ++i) {
        cin>>qs[i];
        qs[i]+=qs[i-1];
    }

    for (int i=1; i<n; ++i) dp[i][1]=qs[i]*(qs[n]-qs[i]), ans[i][1]=i;

    for (int j=2; j<=k; ++j) {
        int now=j%2, pre=1-now;

        for (int i=1; i<n; ++i) {
            //find dp[i][j]

            if (dq.size()>=2) {
                line l1=dq.front(); dq.pop_front();
                line l2=dq.front(); dq.push_front(l1);

                while (ins(l1,l2)<=qs[i] && dq.size()>=2) {
                    dq.pop_front();
                    l1=l2; dq.pop_front();
                    if (dq.size()) l2=dq.front();
                    dq.push_front(l1);
                    if (dq.size()==1) break;
                }
            }

            if (i>=j) {
                dp[i][now]=dq.front().con+dq.front().slope*qs[i]+qs[i]*(qs[n]-qs[i]);
                ans[i][j]=dq.front().ord;
            }

            line l={i,dp[i][pre]-qs[i]*qs[n],qs[i]};

            if (dq.size()>=2) {
                line l1=dq.back(); dq.pop_back();
                line l2=dq.back(); dq.push_back(l1);

                while (ins(l1,l2)>=ins(l,l2) && dq.size()>=2) {
                    dq.pop_back();
                    l1=l2; dq.pop_back();
                    if (dq.size()) l2=dq.back();
                    dq.push_back(l1);
                    if (dq.size()==1) break;
                }

            }

            if (dq.size()) {
                if (dq.back().slope!=l.slope) dq.push_back(l);
            } else dq.push_back(l);
        }

        //for (int i=1; i<=n; ++i) cout<<dp[i][now]<<" ";
        //cout<<"\n";

        while (!dq.empty()) dq.pop_back();
    }
/*
    for (int j=1; j<=k; ++j) {
        for (int i=1; i<=n; ++i) cout<<dp[i][j]<<" ";
        cout<<"\n";
    } */

    ll mmax=-1,mnode;
    for (int i=1; i<n; ++i) {
        if (mmax<dp[i][k%2]) {
            mmax=dp[i][k%2];
            mnode=i;
        }
    }
    cout<<mmax<<"\n";

    vector<int> v;
    while (k) {
        v.push_back(mnode);
        mnode=ans[mnode][k];
        --k;
    }
    reverse(v.begin(),v.end());

    for (auto s : v) cout<<s<<" ";
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:96:20: warning: 'mnode' may be used uninitialized in this function [-Wmaybe-uninitialized]
   96 |         v.push_back(mnode);
      |         ~~~~~~~~~~~^~~~~~~

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