oj.uz

Submission #15363

# Submission time Handle Problem Language Result Execution time Memory
15363 2015-07-12T06:47:26 Z kyma123 최적의 능력 구성 (kriii3_C) C++
0 / 62
 6 ms 17212 KB 
#include <stdio.h>
#include <vector>
using namespace std;

vector<long long int> dp[2];

long long int maxv(vector<long long int> &v){
    long long int M = v[0];
    int n = v.size();
    for(int i=1;i<n;i++)
        M = (M>v[i]) ? M : v[i];
    return M;
}

int main(){
    int n, now, prev;
    scanf("%d", &n);
    vector<int> num;
    num.resize(n);
    for(int i=0;i<n;i++)
        scanf("%d", &num[i]);
    dp[0].resize(1000010);
    dp[1].resize(1000010);
    dp[0][0] = 0;
    dp[0][1] = num[0];
    for(int z=1;z<n;z++){
        now = z%2;
        prev = (z-1)%2;
        dp[now][0] = maxv(dp[prev]);
        for(int i=1;i<z+2;i++)
            dp[now][i] = dp[prev][i-1] + i*num[z];
    }

    printf("%lld\n", maxv(dp[(n-1)%2]));
    return 0;
}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 17212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 37.0

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