제출 #209624

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209624		MetB	Bigger segments (IZhO19_segments)	C++14	100 / 100	335 ms	32632 KiB

segments

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
#define N 2000001
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

ll d_m[N], d[N], p[N], a[N], n;

int main () {
	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> a[i];
		p[i] = a[i] + (i ? p[i-1] : 0);
	}

	memset (d_m, -1, sizeof (d_m));

	for (int i = 0; i < n; i++) {
		if (i) d_m[i] = max (d_m[i], d_m[i-1]);
		d[i] = (d_m[i] >= 0 ? d[d_m[i]] : 0) + 1;

		int l = i + 1, r = n;

		while (l < r) {
			int mid = (l + r) / 2;
			if (p[i] - p[d_m[i]] <= p[mid] - p[i]) r = mid;
			else l = mid + 1;
		}

		d_m[l] = max (d_m[l], (ll)i);
	}

	cout << d[n-1];
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 36 / 36
• Subtask 5: 27 / 27