제출 #539007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
539007		Blundergod	Sum Zero (RMI20_sumzero)	C++17	0 / 100	1080 ms	824 KiB

sumzero

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

void solve() {
	int n;
	cin >> n;
	vector<long long>x(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		cin >> x[i];
	}
	vector<long long>p(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		p[i] = x[i] + p[i - 1];
	}

	auto solveQuery = [&](int l, int r) {

		unordered_map<long long, long long>PrevSum;

		for (int i = l; i <= r; i++) {
			PrevSum[p[i]] = -1e9;
		}

		PrevSum[p[l - 1]] = 0;

		long long sum = 0;

		vector<long long>dp(n + 1, 0);

		for (int i = l; i <= r; i++) {
			sum = p[i];
			dp[i] = dp[i - 1];
			dp[i] = max(dp[i], 1 + PrevSum[sum]);
			PrevSum[sum] = max(PrevSum[sum], dp[i]);
		}
		cout << dp[r] << endl;

	};
	int q;
	cin >> q;
	for (int i = 0; i < q; i++) {
		int l, r;
		cin >> l >> r;
		solveQuery(l, r) ;
	}
}
int main() {

	int T;
	T = 1;
	//cin >> T;
	while (T--) {
		solve();
	}
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 39
• Subtask 3: 0 / 39