제출 #47223

#제출 시각아이디문제언어결과실행 시간메모리
47223szawinisCandies (JOI18_candies)C++17
8 / 100
19 ms17188 KiB
#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';
}

컴파일 시 표준 에러 (stderr) 메시지

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';
                      ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...