제출 #73507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73507		Vardanyan	수열 (APIO14_sequence)	C++14	39 / 100	182 ms	4720 KiB

sequence

//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 2000+7;
int a[N];
long long pref[N];
//long long suf[N];
pair<long long,int> check(int l,int r){
    long long ans = 0;
    int pos = l;
    for(int i = l;i<=r-1;i++){
        long long x = pref[i]-pref[l-1];
        long long y = pref[r]-pref[i];
        x*=y;
        if(x>ans){
            ans = x; pos = i;
        }
    }
    return make_pair(ans,pos);
}
pair<long long,int> dp[N][N];
int par[N][N];
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
    for(int i = 1;i<=n;i++) pref[i] = pref[i-1]+a[i];
//    for(int i = n;i>=1;i--) suf[i] = suf[i+1]+a[i];
    for(int i = 1;i<=n;i++){
        dp[1][i] = check(1,i);
    }
    for(int kk = 2;kk<=k;kk++){
        for(int i = 1;i<=n;i++){
            for(int j = 1;j<i;j++){
                if(dp[kk-1][j].first+(pref[i]-pref[j])*pref[j]>dp[kk][i].first){
                    dp[kk][i].first = dp[kk-1][j].first+(pref[i]-pref[j])*pref[j];
                    dp[kk][i].second = j;
                }
            }
        }
    }
    cout<<dp[k][n].first<<endl;
    int kk = k;
    int nn = n;
    while(dp[kk][nn].second!=0){
        cout<<dp[kk][nn].second<<" ";
        nn = dp[kk][nn].second;
        kk--;
    }
    cout<<endl;
    return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

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

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

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