Submission #1326252

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326252		AzamatRustamov	Bouquet (EGOI24_bouquet)	C++20	8 / 100	80 ms	2736 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> l(n), r(n);
	for (int i=0; i<n; i++) {
		cin >> l[i] >> r[i];
	}
	// let dp(i) be maximum # of
	// flowers you can take from
	// first i flowers
	// then answer is dp[n]
	vector<int> dp(n+1);
	for (int i=0; i<n; i++) {
		dp[i+1] = dp[max(0, i-l[i])] + 1;
	}
	cout << *max_element(dp.begin(), dp.end());
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30