hdu 4638 Group（离线+树状数组）

Group

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 546    Accepted Submission(s): 299

Problem Description

There are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stand in line. Now we select an interval of men to make some group. K men in a group can create K*K value. The value of an interval is sum of these value of groups. The people of same group's id must be continuous. Now we chose an interval of men and want to know there should be how many groups so the value of interval is max.

 

Input

First line is T indicate the case number. For each case first line is n, m(1<=n ,m<=100000) indicate there are n men and m query. Then a line have n number indicate the ID of men from left to right. Next m line each line has two number L,R(1<=L<=R<=n),mean we want to know the answer of [L,R].

 

Output

For every query output a number indicate there should be how many group so that the sum of value is max.

 

Sample Input

1

5 2

3 1 2 5 4

1 5

2 4

 

Sample Output

1 2

 

Source

2013 Multi-University Training Contest 4

 

Recommend

zhuyuanchen520

 

 

 

队友的思路！！

 

先按区间右端点r排升序！！

 

下面是操作：（若之前有相邻的，就把那位上减1，相当于把之前的组归到当前的组！！！）

 

如 　　 3 　　  　　   1　　 　　     2 　　　　    5 　　　　   4

 

3 in：　1

 

1 in：　1　　              1

 

2 in：　1-1=0　　　  1-1=0　　　   1

 

5 in：    0　　　　　  0　　　　　  1　　　　　  1

 

4 in：   0-1=-1  　　    0　　　　　  1                      1-1=0            1

 

 

然后再区间求和即可！！！

 

 

 

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
#define lowbit(x) (x&(-x))
const int N=100010;
int C[N],n;

void add(int x,int inc){
    while(x<=n){
        C[x]+=inc;
        x+=lowbit(x);
    }
}
int sum(int x){
    int res=0;
    while(x){
        res+=C[x];
        x-=lowbit(x);
    }
    return res;
}

int a[N];
struct node 
{
    int l,r,id,ans;
}query[N];
struct ppp
{
    int x[5],cc;
    void init()
    {
        memset(x,0,sizeof(x));
        cc=0;
    }
}b[N];//b[i]用来储存与i相邻的数的下标且 这个相邻的数在i之前!! 
bool cmpR(node a,node b)
{
    return a.r<b.r;
}
bool cmpID(node a,node b)
{
    return a.id<b.id;
}
int main()
{
    int i,m,T;
    scanf("%d",&T);
    while(T--)
    {
        
        memset(C,0,sizeof(C));
        for(i=1;i<N;i++)b[i].init();
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)scanf("%d",&a[i]);
        for(i=1;i<=m;i++)scanf("%d%d",&query[i].l,&query[i].r),query[i].id=i;
        sort(query+1,query+m+1,cmpR);
        int cnt=1;
        for(i=1;i<=n;i++)
        {
            int tmp=a[i];
            if(b[tmp].x[1])add(b[tmp].x[1],-1);//将之前出现过与之相邻的数减1，单点更新！！ 
            if(b[tmp].x[2])add(b[tmp].x[2],-1);
            if(tmp-1>=1)
            {
                b[tmp-1].x[++b[tmp-1].cc]=i;
            }
            if(tmp+1<=n)
            {
                b[tmp+1].x[++b[tmp+1].cc]=i;
            }
            add(i,1);        
            while(i==query[cnt].r)
            {
                query[cnt].ans=sum(query[cnt].r)-sum(query[cnt].l-1);
                cnt++;
            }    
        }
        sort(query+1,query+m+1,cmpID);
        for(i=1;i<=m;i++)printf("%d
",query[i].ans);
    }
}