Submission #336714

#	Time	Username	Problem	Language	Result	Execution time	Memory
336714		amoo_safar	Candies (JOI18_candies)	C++17	0 / 100	24 ms	32000 KiB

candies

// vaziat meshki-ghermeze !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e3 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

ll dp[N][N];

ll a[N];
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	for(int i = 0; i < N; i++)
		fill(dp[i], dp[i] + N, -Inf);
	
	int n;
	cin >> n;

	dp[0][0] = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		for(int j = 1; j + j <= n + 1; j++){
			dp[i][j] = max(dp[i - 1][j], dp[i - 2][j - 1] + a[i]);
		}
		dp[i][0] = 0;
	}

	int sz = (n + 1) / 2;

	ll mx = Inf;
	for(int i = 1; i + 1 <= sz; i++){
		assert(mx >= dp[n][i + 1] - dp[n][i]);
		mx = dp[n][i + 1] - dp[n][i];
	}
	for(int i = 1; i <= sz; i++) cout << dp[n][i] << '\n';
	return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 92