oj.uz

답안 #314801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314801 2020-10-21T08:49:09 Z noob_c0de 수열 (APIO14_sequence) C++17
50 / 100
 251 ms 11512 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define db double
const int mxn=3002,INF=2e18;
int n,k;
int a[mxn];
int pref[mxn];
int dp[mxn][mxn];
int track[mxn][mxn];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 //   freopen("sequence.in","r",stdin);
 //   freopen("sequence.out","w",stdout);
    cin>>n>>k;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        pref[i]=pref[i-1]+a[i];
    }
    int sum=pref[n];
    for (int i=0; i<=n; i++)
        for (int j=0; j<=k+1; j++) dp[i][j]=INF;
    for (int i=1; i<=n; i++) dp[i][1]=pref[i]*pref[i];
    for (int i=2;i<=n;i++)
    {
        for (int j=2;j<=k+1;j++)
        {
            for (int i2=1; i2<i; i2++)
            {
                int tmp=pref[i]-pref[i2];
                if (dp[i][j]>dp[i2][j-1]+tmp*tmp)
                {
                    dp[i][j]=dp[i2][j-1]+tmp*tmp;
                    track[i][j]=i2;
                }
            }
        }
    }
    cout<<(sum*sum-dp[n][k+1])/2<<"\n";
    stack<int> ans;
    while(track[n][k+1])
    {
        n=track[n][k+1];
        ans.push(n);
        k--;
    }
    while(!ans.empty())
    {
        cout<<ans.top()<<" ";
        ans.pop();
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 384 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 384 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 384 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 384 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 384 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 384 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 384 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 384 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 384 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 384 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 384 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 384 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 768 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 768 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 768 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 768 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 768 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 768 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 768 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 768 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 768 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2048 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 2048 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 11 ms 2432 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 1920 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 8 ms 2304 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 10 ms 2432 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 11 ms 2432 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 6 ms 2048 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 2048 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 2176 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8448 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 8 ms 8448 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 210 ms 11512 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 8 ms 8576 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 251 ms 11384 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 204 ms 11000 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 221 ms 11384 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 206 ms 11512 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 53 ms 9080 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 113 ms 9724 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -