제출 #546720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546720		krit3379	수열 (APIO14_sequence)	C++17	60 / 100	2089 ms	85212 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
#define N 100005

struct line{
    long long m,c,i;
    long long val(long long x){return m*x+c;}
    long long inter(line l){return floor((long double)(c-l.c)/(l.m-m));}
};

long long a[N],ans,now;
int p[N][205];
vector<int> cut;
deque<line> dq[205];

int main(){
    int n,k,i,j,now;
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++)scanf("%lld",&a[i]),a[i]+=a[i-1];
    dq[0].push_back({0,0,0});
    for(i=1;i<=n;i++){
        for(j=k;j>0;j--){
            if(dq[j-1].empty())continue;
            while(dq[j-1].size()>=2&&dq[j-1].back().val(a[n]-a[i])<=dq[j-1][dq[j-1].size()-2].val(a[n]-a[i]))dq[j-1].pop_back();
            long long v=dq[j-1].back().val(a[n]-a[i])+a[i]*(a[n]-a[i]);
            if(v>ans)ans=v,now=i;
            p[i][j]=dq[j-1].back().i;
            line l={-a[i],v,i};
            while(dq[j].size()>=2&&dq[j][0].inter(dq[j][1])<=dq[j][0].inter(l))dq[j].pop_front();
            dq[j].push_front(l);
        }
    }
    while(now){
        cut.push_back(now);
        now=p[now][k--];
    }
    printf("%lld\n",ans);
    for(auto x:cut)printf("%d ",x);
    return 0;
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d %d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:19:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     for(i=1;i<=n;i++)scanf("%lld",&a[i]),a[i]+=a[i-1];
      |                      ~~~~~^~~~~~~~~~~~~~

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