# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119215 | MateiKing80 | Sum Zero (RMI20_sumzero) | 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;
int lift[17][1 << 17];
int main()
{
int n, q;
cin >> n >> q;
for(int i = 1; i <= n; i ++)
cin >> a[i], a[i] += a[i - 1];
map<int, int> mp;
int last = n + 1; //se termina aici
for(int i = n; i; i --)
{
if(mp[a[i]] != 0)
last = min(last, mp[a[i]]);
mp[a[i]] = i;
}
}
/*
ne trebuie prima pereche de sume partiale egale care se afla
la dreapta unui punct
si facem binary lifting pe tot
yessir
*/