提出 #57709569

ソースコード 拡げる

#include <stdio.h>
#include <inttypes.h>

int N;
int A[212345];

uint64_t memo[212345][2];

uint64_t calc(int pos, int next_bonus) {
	uint64_t ans, candidate;
	if (pos >= N) return 0;
	if (memo[pos][next_bonus]) return ~memo[pos][next_bonus];

	ans = calc(pos + 1, next_bonus);
	candidate = calc(pos + 1, !next_bonus) + (uint64_t)A[pos] * (next_bonus + 1);
	if (candidate > ans) ans = candidate;

	return ~(memo[pos][next_bonus] = ~ans);
}

int main(void) {
	int i;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	printf("%" PRIu64 "\n", calc(0, 0));
	return 0;
}

提出情報

提出日時
問題 D - Bonus EXP
ユーザ mikecat
言語 C (gcc 12.2.0)
得点 400
コード長 654 Byte
結果 AC
実行時間 31 ms
メモリ 18140 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 2
AC × 49
セット名 テストケース
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, random_31.txt, random_32.txt, random_33.txt, random_34.txt, random_35.txt, random_36.txt, random_37.txt, random_38.txt, random_39.txt
ケース名 結果 実行時間 メモリ
example_00.txt AC 0 ms 1628 KiB
example_01.txt AC 1 ms 1716 KiB
hand_00.txt AC 21 ms 18128 KiB
hand_01.txt AC 24 ms 17992 KiB
hand_02.txt AC 0 ms 1628 KiB
hand_03.txt AC 22 ms 17996 KiB
hand_04.txt AC 23 ms 17992 KiB
hand_05.txt AC 24 ms 18028 KiB
hand_06.txt AC 0 ms 1620 KiB
random_00.txt AC 22 ms 18012 KiB
random_01.txt AC 25 ms 18028 KiB
random_02.txt AC 22 ms 17972 KiB
random_03.txt AC 22 ms 18020 KiB
random_04.txt AC 28 ms 18124 KiB
random_05.txt AC 31 ms 18020 KiB
random_06.txt AC 23 ms 18024 KiB
random_07.txt AC 26 ms 18108 KiB
random_08.txt AC 21 ms 17964 KiB
random_09.txt AC 30 ms 17992 KiB
random_10.txt AC 26 ms 17996 KiB
random_11.txt AC 19 ms 18140 KiB
random_12.txt AC 24 ms 18040 KiB
random_13.txt AC 22 ms 17992 KiB
random_14.txt AC 28 ms 18120 KiB
random_15.txt AC 27 ms 18108 KiB
random_16.txt AC 31 ms 18016 KiB
random_17.txt AC 28 ms 18128 KiB
random_18.txt AC 21 ms 18128 KiB
random_19.txt AC 24 ms 17956 KiB
random_20.txt AC 25 ms 17968 KiB
random_21.txt AC 29 ms 18136 KiB
random_22.txt AC 26 ms 18016 KiB
random_23.txt AC 25 ms 18104 KiB
random_24.txt AC 27 ms 18016 KiB
random_25.txt AC 27 ms 18124 KiB
random_26.txt AC 27 ms 18140 KiB
random_27.txt AC 27 ms 18132 KiB
random_28.txt AC 27 ms 18108 KiB
random_29.txt AC 27 ms 18020 KiB
random_30.txt AC 31 ms 18036 KiB
random_31.txt AC 31 ms 17996 KiB
random_32.txt AC 31 ms 17972 KiB
random_33.txt AC 31 ms 17960 KiB
random_34.txt AC 31 ms 17988 KiB
random_35.txt AC 31 ms 18020 KiB
random_36.txt AC 31 ms 17972 KiB
random_37.txt AC 31 ms 17968 KiB
random_38.txt AC 31 ms 17956 KiB
random_39.txt AC 31 ms 18116 KiB