oj.uz

Submission #7738

# Submission time Handle Problem Language Result Execution time Memory
7738 2014-08-17T09:37:57 Z gs14004 Split the sequence (APIO14_sequence) C++
0 / 100
 0 ms 131072 KB 
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long lint;

int n,k;
lint dp[100005][205],a[100005];
int track[100005][205];

int main(){
    int t;
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&t);
        a[i+1] = a[i] + t;
    }
    for (int i=n; i>=1; i--) {
        for (int j=k; j>=1; j--) {
            lint res = 0;
            for (int k=i+1; k<=n; k++) {
                lint piv = dp[k][j-1] + (a[k-1]-a[i-1])*(a[n]-a[k-1]);
                if(res < piv){
                    res = piv;
                    track[i][j] = k;
                }
            }
            dp[i][j] = res;
        }
    }
    printf("%lld\n",dp[1][k]);
    int pos1 = 1, pos2 = k;
    for (int i=0; i<k; i++) {
        printf("%d ",track[pos1][pos2]-1);
        pos1 = track[pos1][pos2];
        pos2--;
    }
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Memory limit exceeded 0 ms 131072 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #5
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -