oj.uz

답안 #300567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300567 2020-09-17T09:38:25 Z NicolaAbusaad2014 수열 (APIO14_sequence) C++14
50 / 100
 120 ms 3712 KB 
#include <bits/stdc++.h>

using namespace std;
long long dp[1001][202]={},n,k,arr[1001]={},from[1001][202]={};
void solve(long x)
{
    if(x==n){
    return;
    }
    for(long i=0;i<x;i++){
    for(long j=1;j<=k;j++){
    if(dp[i][j]+((arr[n-1]-arr[x])*(arr[x]-arr[i]))>dp[x][j+1]){
    dp[x][j+1]=dp[i][j]+((arr[n-1]-arr[x])*(arr[x]-arr[i]));
    from[x][j+1]=i;
    }
    }
    }
    solve(x+1);
}
int main()
{
    long long x;
    cin>>n>>k;
    cin>>x;
    arr[0]=x;
    for(long i=1;i<n;i++){
    cin>>x;
    arr[i]=arr[i-1]+x;
    }
    for(long i=0;i<n;i++){
    dp[i][1]=arr[i]*(arr[n-1]-arr[i]);
    }
    solve(1);
    cout<<dp[n-1][k+1]<<endl;
    long now=from[n-1][k+1];
    stack<long>s;
    for(long i=0;i<k;i++){
    s.push(now);
    now=from[now][k-i];
    }
    while(!s.empty()){
    cout<<s.top()+1<<endl;
    s.pop();
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 416 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 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 512 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 512 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 512 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 512 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 512 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 512 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 512 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 512 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 512 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 512 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3456 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 3456 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 117 ms 3480 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 3456 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 120 ms 3576 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 99 ms 3448 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 115 ms 3452 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 113 ms 3448 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 35 ms 3456 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 59 ms 3448 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 3712 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 3712 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -