제출 #208033

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

sequence

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 100005
#define MAXK 205
typedef long long ll;


using namespace std;

ll n,u;
ll dp[MAXN][MAXK];
ll niz[MAXN];
ll suma[MAXN];
ll sec[MAXN][MAXK];
ll resi(ll d,ll k){
    if(dp[d][k]!=-1)return dp[d][k];
    if(k==0 || d==1){

            //printf("   %lld %lld %lld %lld\n",l,d,k,dp[l][d][k]);
        return dp[d][k]=0;
    }

    for(ll i=k+1;i<=d;i++){
        ll tr=suma[i-1]*(suma[d]-suma[i-1])+resi(i-1,k-1);
        if(tr>dp[d][k]){
            sec[d][k]=i-1;
            dp[d][k]=tr;
        }

    }
    //printf("   %lld %lld %lld %lld\n",l,d,k,dp[l][d][k]);
    return dp[d][k];
}

int main()
{
    scanf("%lld %lld", &n, &u);
    for(ll i=0;i<=n;i++){
        for(ll j=0;j<=u;j++){
            dp[i][j]=-1;
        }
    }
    for(ll i=1;i<=n;i++)
        scanf("%lld",niz+i);
    for(ll i=1;i<=n;i++)
        suma[i]=suma[i-1]+niz[i];


    for(int k=1;k<=u;k++){
        for(int d=k+1;d<=n;d++){
            for(ll i=k+1;i<=d;i++){
                ll tr=suma[i-1]*(suma[d]-suma[i-1])+resi(i-1,k-1);
                if(tr>dp[d][k]){
                    sec[d][k]=i-1;
                    dp[d][k]=tr;
                }

            }
        }
    }

    printf("%lld\n",resi(n,u));
    ll poc=n;
    for(ll i=u;i>0;i--){
        poc=sec[poc][i];
        printf("%lld ",poc);
    }
    return 0;
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &n, &u);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",niz+i);
         ~~~~~^~~~~~~~~~~~~~

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