제출 #250916

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

sequence

#include <bits/stdc++.h>
using namespace std;
typedef pair<long long,int> pll;
long long n,k,s[100100],dp[210];
int rev[100100][210];
class line
{
    public:
        long long a,b;
    bool operator == (const line& rhs) const
    {
        return (a==rhs.a)&&(b==rhs.b);
    }
};
double cross(line l1, line l2)
{
    return (double) (l1.b-l2.b)/(l2.a-l1.a);
}
class convexhulltrick
{
    public:
        int s,e,ind[100100];
        line deq[100100];
        void insert(line l,int in)
        {
            if(deq[e-1]==l)
            {
                ind[e-1] = in;
                return;
            }
            ind[e] = in;
            deq[e] = l;
            while(s+1<e&&cross(deq[e-2],deq[e-1])>=cross(deq[e-1],deq[e]))
            {
                deq[e-1] = deq[e];
                ind[e-1] = ind[e];
                e--;
            }
            e++;
        }
        pll query(long long x)
        {
            long long l = s,r = e-1;
            while(l!=r)
            {
                long long m = (l+r)/2;
                if(cross(deq[m],deq[m+1])<=x)
                    l = m+1;
                else r = m;
            }
            return {deq[l].a*x+deq[l].b,ind[l]};
        }
};
convexhulltrick cht[210];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>s[i];
    for(int i=1;i<=n;i++)
        s[i] += s[i-1];
    for(long long i=0;i<=k;i++)
    {
        line tmp;
        tmp.a = 0;
        tmp.b = -1000000000000000;        
        cht[i].insert(tmp,0);
    }
    for(long long i=1;i<=n;i++)
    {
        for(int j=1;j<=k;j++)
        {
            pll hamin = cht[j-1].query(s[i]);
            dp[j] = hamin.first;
            rev[i][j] = hamin.second;
        }
        line tmp;
        tmp.a = s[i];
        for(int j=0;j<k;j++)
        {
            tmp.b = dp[j]-s[i]*s[i];
            cht[j].insert(tmp,i);
        }
    }
    long long last = n;
    cout<<dp[k]<<"\n";
    for(int i=0;i<k;i++)
    {
        last = rev[last][k-i];
        cout<<last<<" ";
    }
}

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