| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 529454 | jiahng | Cigle (COI21_cigle) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MOD 1000000007
#define maxn 5001
#define getchar_unlocked _getchar_nolock
int N,D[maxn],ss[maxn];
inline int readInt() {
int x = 0;
char ch = getchar_unlocked();
while (ch < '0' || ch > '9') ch = getchar_unlocked();
while (ch >= '0' && ch <= '9'){
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar_unlocked();
}
return x;
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
vi A[maxn];
int dp[maxn],R[maxn][maxn];
int32_t main() {
fast;
N = readInt();
FOR(i,1,N){
D[i] = readInt();
ss[i] = ss[i-1] + D[i];
}
mem(R, -1);
FOR(l,1,N) FOR(r,l+1,N) if ((ss[l-1] + ss[r]) % 2 == 0){
int ssb = (ss[l-1] + ss[r]) / 2;
int b = lower_bound(ss+l,ss+r,ssb) - ss;
if (ss[b] == ssb){
//~ cout << l << ' ' << b << ' ' << r << '\n';
A[b].pb(l);
assert(R[l][b] == -1);
R[l][b] = r+1;
}
}
DEC(i,N,1){
dp[i] = dp[i+1];
FOR(b, i, N) if (R[i][b] != -1) {
//~ if (i == 3) cout << b << ' ' << R[i][b] << ' ' << (A[b].end() - lbd(A[b], i)) << '\n';
dp[i] = max(dp[i], dp[R[i][b] + 1] + (A[b].end() - lbd(A[b], i)));
}
//~ cout << dp[i] << ' ';
}
cout << dp[1];
}