답안 #47223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47223	2018-04-29T10:15:58 Z	szawinis	Candies (JOI18_candies)	C++17	8 / 100	19 ms	17188 KB

candies

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e3+1;

int n;
ll a[N], dp[N][N], res[N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		dp[i][1] = max(dp[i-1][1], a[i]);
		res[1] = max(a[i], res[1]);
		for(int j = 2; j <= i+1 >> 1; j++) {
			dp[i][j] = max(dp[i-2][j-1] + a[i], dp[i-1][j]);
			res[j] = max(dp[i][j], res[j]);
			// cout << i << ' ' << j << ' ' << dp[i][j] << endl;
		}
	}
	for(int i = 1; i <= n+1 >> 1; i++) cout << res[i] << '\n';
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:16:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   for(int j = 2; j <= i+1 >> 1; j++) {
                       ~^~
candies.cpp:22:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  for(int i = 1; i <= n+1 >> 1; i++) cout << res[i] << '\n';
                      ~^~

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	16248 KB	Output is correct
2	Correct	14 ms	16364 KB	Output is correct
3	Correct	14 ms	16508 KB	Output is correct
4	Correct	15 ms	16656 KB	Output is correct
5	Correct	14 ms	16796 KB	Output is correct
6	Correct	14 ms	16796 KB	Output is correct
7	Correct	15 ms	16852 KB	Output is correct
8	Correct	14 ms	16852 KB	Output is correct
9	Correct	14 ms	16940 KB	Output is correct
10	Correct	14 ms	16940 KB	Output is correct
11	Correct	15 ms	16940 KB	Output is correct
12	Correct	15 ms	16940 KB	Output is correct
13	Correct	15 ms	16940 KB	Output is correct
14	Correct	15 ms	16940 KB	Output is correct
15	Correct	15 ms	16940 KB	Output is correct
16	Correct	18 ms	16940 KB	Output is correct
17	Correct	17 ms	16980 KB	Output is correct
18	Correct	16 ms	17000 KB	Output is correct
19	Correct	19 ms	17000 KB	Output is correct
20	Correct	17 ms	17040 KB	Output is correct

Subtask #2

0 / 92.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	16248 KB	Output is correct
2	Correct	14 ms	16364 KB	Output is correct
3	Correct	14 ms	16508 KB	Output is correct
4	Correct	15 ms	16656 KB	Output is correct
5	Correct	14 ms	16796 KB	Output is correct
6	Correct	14 ms	16796 KB	Output is correct
7	Correct	15 ms	16852 KB	Output is correct
8	Correct	14 ms	16852 KB	Output is correct
9	Correct	14 ms	16940 KB	Output is correct
10	Correct	14 ms	16940 KB	Output is correct
11	Correct	15 ms	16940 KB	Output is correct
12	Correct	15 ms	16940 KB	Output is correct
13	Correct	15 ms	16940 KB	Output is correct
14	Correct	15 ms	16940 KB	Output is correct
15	Correct	15 ms	16940 KB	Output is correct
16	Correct	18 ms	16940 KB	Output is correct
17	Correct	17 ms	16980 KB	Output is correct
18	Correct	16 ms	17000 KB	Output is correct
19	Correct	19 ms	17000 KB	Output is correct
20	Correct	17 ms	17040 KB	Output is correct
21	Incorrect	17 ms	17188 KB	Output isn't correct
22	Halted	0 ms	0 KB	-