Submission #874798

#	Time	Username	Problem	Language	Result	Execution time	Memory
874798		TAhmed33	Sum Zero (RMI20_sumzero)	C++98	0 / 100	1053 ms	852 KiB

sumzero

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main () {
	int n; cin >> n;
	int arr[n + 1] = {};
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
		arr[i] += arr[i - 1];
	}
	int q;
	cin >> q;
	while (q--) {
		int pp[n + 1] = {};
		int l, r;
		cin >> l >> r;
		map <int, int> dd; dd[arr[r]] = r;
		for (int i = r - 1; i >= l - 1; i--) {
			pp[i] = pp[i + 1];
			if (dd.count(arr[i])) pp[i] = max(pp[i], 1 + pp[dd[arr[i]]]);
			dd[arr[i]] = i;
		}
		cout << *max_element(pp, pp + n + 1) << '\n';
	}
}

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