oj.uz

답안 #383730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
383730 2021-03-30T18:15:19 Z shafinalam 수열 (APIO14_sequence) C++14
50 / 100
 2000 ms 24684 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll>pii;
typedef pair<pii,pii>piii;
const int mxn = 1e4+5;
#define inf 1e16
#define all(v) v.begin(), v.end()
#define  FAST  ios_base::sync_with_stdio(0);cout.tie(0)
 
 
ll arr[mxn];
ll dp[mxn][205];
ll pre[mxn];
int dir[mxn][205];
int n, k;
 
ll solve(int pos, int x)
{
    if(pos>n) {
        return -inf;
    }
    if(x==k) return 0;
    if(dp[pos][x]!=-1) return dp[pos][x];
    ll sum = 0, ret = -inf;
    for(int i = pos; i <= n; i++) {
        sum+=arr[i];
        ll tmp = max(ret, solve(i+1, x+1)+(sum*pre[i+1]));
        if(tmp>ret) {
            ret = tmp;
            dir[pos][x] = i+1;
        }
    }
    return dp[pos][x] = ret;
}
void pathprint(int pos, int x)
{
    if(x==k) return;
    cout << dir[pos][x]-1 << ' ';
    pathprint(dir[pos][x], x+1);
}
int main()
{
    FAST;    
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    pre[n] = arr[n];
    for(int i = n-1; i >= 1; i--) {
        pre[i] = pre[i+1]+arr[i];
    }
    memset(dp, -1, sizeof dp);
    ll ans = solve(1, 0);
    cout << ans << '\n';
    pathprint(1, 0);
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 17260 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 16 ms 17260 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 509 ms 17260 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 17 ms 17260 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 509 ms 17388 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 445 ms 17260 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 501 ms 17388 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 502 ms 17260 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 125 ms 17388 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 234 ms 17444 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 24684 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 784 ms 24684 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2090 ms 24556 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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