Zero Query SPOJ - ZQUERY

Given an array having N elements, each element is either -1 or 1.

You have M queries, each query has two numbers L and R, you have to answer the length of the longest subarray in range L to R (inclusive) that its sum is equal to 0.

Input

The first line contains two numbers N and M (1 <= N, M <= 50000) - the number of elements and the number of queries.

The second line contains N numbers - the elements of the array, each element is either -1 or 1.

In the next M lines, each line contains two numbers L and R (1 <= L <= R <= N).

Output

For each query, print the length of the longest subarray that satisfies the query in one line. If there isn't any such subarray, print 0.

Note

Subarray in an array is like substring in a string, i.e. subarray should contain contiguous elements.

Example

Input:
6 4
1 1 1 -1 -1 -1
1 3
1 4
1 5
1 6

Output:
0
2
4
6
题解：。。。真不知道咋说， 具体看代码吧，分块好懂，主要是找满足题意的subarry时，想到二分，最后注意一下lower_bound的细节。

#pragma warning(disable:4996)
#include<vector>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxb = 300;
const int maxm = 50010;
const int maxn = 100020;

int n, m;
int a[maxm], Be[maxm], ans[maxb][maxb], use[maxn];

vector<int> add[maxn];

int main()
{
    while (scanf("%d%d", &n, &m) != EOF) {

        for (int i = 0; i < maxn; i++) if (!add[i].empty()) add[i].clear();

        int unit = sqrt(n);  //每个块里面有多少个数
        int cnt;
        if (n % unit) cnt = n / unit + 1;
        else cnt = n / unit;

        a[0] = 50010;
        add[a[0]].push_back(0);

        for (int i = 1; i <= n; i++) {
            scanf("%d", a + i);
            a[i] += a[i - 1];        //前缀和
            add[a[i]].push_back(i);
            if (i % unit) Be[i] = i / unit + 1;     //每个元素属于哪个块
            else Be[i] = i / unit;
        }
        //预处理块与块之间的最长Subarray
        for (int i = 1; i <= n; i += unit) {

            memset(use, -1, sizeof(use));
            use[a[i - 1]] = i - 1;

            int temp = 0;
            int block = i / unit + 1;

            for (int j = i; j <= n; j++) {
                if (use[a[j]] == -1) use[a[j]] = j;
                else temp = max(temp, j - use[a[j]]);
                if (j % unit == 0) ans[block][j / unit] = temp;
            }
            ans[block][cnt] = temp;
        }

        while (m--) {

            int x, y;
            scanf("%d%d", &x, &y);
            x--;
            //属于相邻的两块或者在同一块
            if (Be[x + 1] + 1 >= Be[y]) {
                int len = 0;
                for (int i = x; i < y; i++) {
                    if (add[a[i]].size() == 1) continue;

                    int pos = lower_bound(add[a[i]].begin(), add[a[i]].end(), y) - add[a[i]].begin();

                    if (pos == add[a[i]].size()) len = max(len, add[a[i]][pos - 1] - i);
                    else if (add[a[i]][pos] == y) len = max(len, add[a[i]][pos] - i);
                    else len = max(len, add[a[i]][pos - 1] - i);
                }
                printf("%d\n", len);
            }
            else {
                int l = min(Be[x + 1] * unit, n);
                int r = (Be[y] - 1) * unit + 1;
                int len = ans[Be[x + 1] + 1][Be[y] - 1];

                for (int i = x; i < l; i++) {
                    if (add[a[i]].size() == 1) continue;

                    int pos = lower_bound(add[a[i]].begin(), add[a[i]].end(), y) - add[a[i]].begin();

                    if (pos == add[a[i]].size()) len = max(len, add[a[i]][pos - 1] - i);
                    else if (add[a[i]][pos] == y) len = max(len, add[a[i]][pos] - i);
                    else len = max(len, add[a[i]][pos - 1] - i);
                }

                for (int i = r; i <= y; i++) {
                    int pos = lower_bound(add[a[i]].begin(), add[a[i]].end(), x) - add[a[i]].begin();
                    len = max(len, i - add[a[i]][pos]);
                }

                printf("%d\n", len);
            }
        }
    }
    return 0;
}