Submission #653982

#	Time	Username	Problem	Language	Result	Execution time	Memory
653982		pavement	Cigle (COI21_cigle)	C++17	100 / 100	195 ms	67452 KiB

cigle

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
//~ #define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, ans, p[5005], dp[5005][5005], m[5005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> p[i];
		p[i] += p[i - 1];
	}
	for (int j = N; j >= 1; j--) {
		for (int k = N; k > j; k--)
			m[k] = max(m[k + 1], dp[j + 1][k]);
		int ptr = j + 1, sf = 0, cnt = 0;
		for (int i = j; i >= 1; i--) {
			int ans = -1;
			while (ptr <= N && p[ptr] - p[j] < p[j] - p[i - 1]) ptr++;
			if (ptr <= N && p[ptr] - p[j] == p[j] - p[i - 1]) ans = ptr;
			dp[i][j] = sf;
			if (ans != -1) {
				cnt++;
				if (ans + 1 <= N) sf = max(sf, m[ans + 1] + cnt);
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		ans = max(ans, dp[1][i]);
	}
	cout << ans << '\n';
}

Compilation message (stderr)

cigle.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 52 / 52