BZOJ 4241 历史研究

莫队 或 分块

莫队和分块都不难想到，分块做法可以支持在线。好久没写莫队了就写它吧。

好气啊，本智障在莫队数组清零的if后面多打了一个分号，就这东西调了一个小时我会乱说？吃枣药丸。
更气的是昨天刚装的ubuntu怎么今天开机输入法就变没了？

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100005
#define S 333
using namespace std;
namespace runzhe2000
{
    typedef long long ll;
    bool ok[N]; ll ans[N];
    int n, qcnt, a[N], block[N], arr[N], arrcnt, val[N], t[N], tmp[N], vis[N], timer;
    struct query{int l, r, id;}q[N];
    bool operator < (query a, query b) {return block[a.l] < block[b.l] || (block[a.l] == block[b.l] && a.r < b.r);}
    void main()
    {
        scanf("%d%d",&n,&qcnt);
        block[0] = 1;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&a[i]);
            arr[++arrcnt] = a[i];
            block[i] = i % S ? block[i-1] : block[i-1] + 1;
        }
        block[q[0].l = 0] = -1;

        sort(arr+1,arr+1+arrcnt);
        arrcnt = unique(arr+1, arr+1+arrcnt) - arr - 1;
        for(int i = 1; i <= n; i++)
        {
            int pos = lower_bound(arr+1, arr+1+arrcnt, a[i]) - arr;
            val[pos] = a[i];
            a[i] = pos;
        }

        for(int i = 1; i <= qcnt; i++)
        {
            scanf("%d%d",&q[i].l,&q[i].r);
            ans[q[i].id = i] = 0;

            if(block[q[i].l] == block[q[i].r])
            {
                ++timer;
                ll nowmx = 0;
                for(int j = q[i].l; j <= q[i].r; j++)
                {
                    int v = a[j];
                    if(vis[v] != timer)
                    {
                        vis[v] = timer;
                        tmp[v] = 0;
                    }
                    tmp[v]++;
                    if((ll)val[v] * tmp[v] > nowmx)
                        nowmx = (ll)val[v] * tmp[v];
                }
                ans[q[i].id] = nowmx;
                ok[q[i].id] = 1;
            }
        }
        sort(q+1, q+1+qcnt);

        int nowl = 0, nowr; ll nowmx; ++timer;
        for(int i = 1; i <= qcnt; i++, timer++)
        {
            if(ok[q[i].id]) continue;
            if(block[q[i].l] != block[q[i-1].l] || ok[q[i-1].id]) //,
            {
                nowl = block[q[i].l] * S;
                nowr = nowl-1;
                nowmx = 0;
                memset(t, 0, sizeof(t));
            }
            for(; nowr < q[i].r; nowr++)
            {
                int v = a[nowr+1];
                t[v]++;
                if((ll)t[v] * val[v] > nowmx)
                    nowmx = (ll)t[v] * val[v];
            }
            int tmpl = nowl; ll tmpmx = nowmx;
            for(; q[i].l < tmpl; tmpl--)
            {
                int v = a[tmpl-1];
                if(vis[v] != timer)
                    vis[v] = timer, tmp[v] = 0;
                tmp[v]++;
                if((ll)(t[v] + tmp[v]) * val[v] > tmpmx) 
                    tmpmx = (ll)(t[v] + tmp[v]) * val[v];
            }
            ans[q[i].id] = tmpmx;
        }
        for(int i = 1; i <= qcnt; i++)
            printf("%lld\n",ans[i]); 
    }
}
int main()
{
    runzhe2000::main();
}