답안 #15457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
15457	2015-07-12T08:00:18 Z	skeksk91	달리는 게임 (kriii3_E)	C++	70 / 70	224 ms	16708 KB

E

#include<stdio.h>

double arr[1000001];
double sum[1000001];


int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lf", &arr[i]);
		sum[i] = sum[i - 1] + arr[i];
	}
	int tail = n;
	double ans = 0;
	for (int i = n; i >= 1; i--) {
		if (sum[tail] - sum[i - 1] > 0) {
			ans += sum[tail] - sum[i - 1];
		}
		else {
			tail = i - 1;
		}
	}
	printf("%.0lf", ans);

}

Subtask #1

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	16708 KB	Output is correct
2	Correct	0 ms	16708 KB	Output is correct
3	Correct	0 ms	16708 KB	Output is correct
4	Correct	0 ms	16708 KB	Output is correct
5	Correct	1 ms	16708 KB	Output is correct
6	Correct	0 ms	16708 KB	Output is correct
7	Correct	0 ms	16708 KB	Output is correct
8	Correct	0 ms	16708 KB	Output is correct
9	Correct	0 ms	16708 KB	Output is correct
10	Correct	0 ms	16708 KB	Output is correct
11	Correct	0 ms	16708 KB	Output is correct
12	Correct	0 ms	16708 KB	Output is correct
13	Correct	0 ms	16708 KB	Output is correct
14	Correct	0 ms	16708 KB	Output is correct
15	Correct	0 ms	16708 KB	Output is correct
16	Correct	0 ms	16708 KB	Output is correct
17	Correct	0 ms	16708 KB	Output is correct
18	Correct	0 ms	16708 KB	Output is correct

Subtask #2

44.0 / 44.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	16708 KB	Output is correct
2	Correct	0 ms	16708 KB	Output is correct
3	Correct	0 ms	16708 KB	Output is correct
4	Correct	26 ms	16708 KB	Output is correct
5	Correct	0 ms	16708 KB	Output is correct
6	Correct	16 ms	16708 KB	Output is correct
7	Correct	124 ms	16708 KB	Output is correct
8	Correct	207 ms	16708 KB	Output is correct
9	Correct	224 ms	16708 KB	Output is correct