Submission #15329

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15329	2015-07-12T06:14:47 Z	kyma123	달리는 게임 (kriii3_E)	C++	0 / 70	2 ms	5452 KB

E

#include <stdio.h>
#include <vector>
using namespace std;

vector<vector<long long int> > dp;

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;
    scanf("%d", &n);
    vector<int> num;
    num.resize(n);
    for(int i=0;i<n;i++)
        scanf("%d", &num[i]);
    dp.resize(n);
    dp[0].resize(2);
    dp[0][0] = 0;
    dp[0][1] = num[0];
    for(int z=1;z<n;z++){
        dp[z].resize(z+2);
        dp[z][0] = maxv(dp[z]);
        for(int i=1;i<z+2;i++)
            dp[z][i] = dp[z-1][i-1] + i*num[z];
    }
    /*
    for(int z=0;z<n;z++){
        for(int i=0;i<z+2;i++)
            printf("%4lld", dp[z][i]);
        printf("\n");
    }
    */
    printf("%lld\n", maxv(dp[n-1]));
    return 0;
}

Subtask #1

0.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	5452 KB	Output is correct
2	Incorrect	2 ms	5452 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 44.0

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