Submission #15375

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15375	2015-07-12T06:53:59 Z	tlwpdus	달리는 게임 (kriii3_E)	C++	26 / 70	6 ms	9060 KB

E

#include<stdio.h>

using namespace std;

long long map[1010][1010];
long long sco[1010];
int n;

void input() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%lld", &sco[i]);
	}
}

void process() {
	int i, j, k;
	long long maxi;
	for (j = 0; j < n; j++) {
		for (i = 0; i <= j+1; i++) {
			if (i == 0) {
				if (j == 0){
					map[i][j] = 0;
					continue;
				}
				maxi = -1000000000000000000L;
				for (k = 0; k <= j; k++) {
					if (maxi < map[k][j - 1]) maxi = map[k][j - 1];
					map[i][j] = maxi;
				}
				continue;
			}
			if (j == 0) map[i][j] = i*sco[j];
			else {
				map[i][j] = map[i - 1][j - 1] + i*sco[j];
			}
		}
	}
	maxi = -1000000000000000000L;
	for (i = 0; i <= n; i++) if (maxi < map[i][n - 1]) maxi = map[i][n - 1];
	printf("%lld\n", maxi);
}

int main() {
	input();
	process();
	return 0;
}

Subtask #1

26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	9060 KB	Output is correct
2	Correct	5 ms	9060 KB	Output is correct
3	Correct	5 ms	9060 KB	Output is correct
4	Correct	0 ms	9060 KB	Output is correct
5	Correct	5 ms	9060 KB	Output is correct
6	Correct	5 ms	9060 KB	Output is correct
7	Correct	5 ms	9060 KB	Output is correct
8	Correct	5 ms	9060 KB	Output is correct
9	Correct	2 ms	9060 KB	Output is correct
10	Correct	2 ms	9060 KB	Output is correct
11	Correct	5 ms	9060 KB	Output is correct
12	Correct	2 ms	9060 KB	Output is correct
13	Correct	5 ms	9060 KB	Output is correct
14	Correct	5 ms	9060 KB	Output is correct
15	Correct	2 ms	9060 KB	Output is correct
16	Correct	2 ms	9060 KB	Output is correct
17	Correct	0 ms	9060 KB	Output is correct
18	Correct	0 ms	9060 KB	Output is correct

Subtask #2

0.0 / 44.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	6 ms	9056 KB	Program hung waiting for input
2	Halted	0 ms	0 KB	-