HDU4046--Panda(树状数组)

Panda

Time Limit: 10000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3343    Accepted Submission(s): 1075

Problem Description

When I wrote down this letter, you may have been on the airplane to U.S. 

We have known for 15 years, which has exceeded one-fifth of my whole life. I still remember the first time we went to the movies, the first time we went for a walk together. I still remember the smiling face you wore when you were dressing in front of the mirror.
I love your smile and your shining eyes. When you are with me, every second is wonderful.

The more expectation I had, the more disappointment I got. You said you would like to go to U.S.I know what you really meant. I respect your decision. Gravitation is not responsible for people falling in love. I will always be your best friend. I know the way
is difficult. Every minute thinking of giving up, thinking of the reason why you have held on for so long, just keep going on. Whenever you’re having a bad day, remember this: I LOVE YOU.

I will keep waiting, until you come back. Look into my eyes and you will see what you mean to me.

There are two most fortunate stories in my life: one is finally the time I love you exhausted. the other is that long time ago on a particular day I met you.

Saerdna.



It comes back to several years ago. I still remember your immature face.

The yellowed picture under the table might evoke the countless memory. The boy will keep the last appointment with the girl, miss the heavy rain in those years, miss the love in those years. Having tried to conquer the world, only to find that in the end, you
are the world. I want to tell you I didn’t forget. Starry night, I will hold you tightly. 



Saerdna loves Panda so much, and also you know that Panda has two colors, black and white.

Saerdna wants to share his love with Panda, so he writes a love letter by just black and white.

The love letter is too long and Panda has not that much time to see the whole letter.

But it's easy to read the letter, because Saerdna hides his love in the letter by using the three continuous key words that are white, black and white.

But Panda doesn't know how many Saerdna's love there are in the letter.

Can you help Panda?

 

Input

An integer T means the number of test cases T<=100

For each test case:

First line is two integers n, m

n means the length of the letter, m means the query of the Panda. n<=50000,m<=10000

The next line has n characters 'b' or 'w', 'b' means black, 'w' means white.

The next m lines 

Each line has two type

Type 0: answer how many love between L and R. (0<=L<=R<n)

Type 1: change the kth character to ch(0<=k<n and ch is ‘b’ or ‘w’)

 

Output

For each test case, output the case number first.

The answer of the question.

 

Sample Input

2
5 2
bwbwb
0 0 4
0 1 3
5 5
wbwbw
0 0 4
0 0 2
0 2 4
1 2 b
0 0 4

 

Sample Output

Case 1:
1
1
Case 2:
2
1
1
0

 

题目大意：

文章开头是一篇凄美的情书，深得我心~然后他们之间的约定便是信中特殊格式的字符串，wbw。题目要求去统计区间之内有多少个这样的字符串。





解题思路：

这不就是区间求和吗？自然而然就联想到了树状数组。隐形的看不见的数组a[]已经淡化了。如果要写出来，以第一组字符串为例就是这个样子：(字符串下标从1开始)





a[1]=0,a[2]=0,a[3]=0,a[4]=1,a[5]=0;

代表从位置i开始，与向前的i-1和i-2能否构成一个特殊的wbw。c[]数组就是对a[]的加和，但是代码中可以不用写出来。WA是因为，没注意每次查询之后进行字符的更新，坑。





源代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<deque>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cstdlib>
#include<cmath>
#include<sstream>
#include<ctime>
using namespace std;
 
typedef long long ll;
#define eps 1e-6
#define e exp(1.0)
#define pi acos(-1.0)
const int MAXN = 50010;
const int INF = 0x3f3f3f3f;
 
int c[MAXN];
int n,m;
int lowbit(int x)
{
    return x&(-x);
}
 
void add(int x, int num)
{
    while(x<=n)
    {
        c[x]+=num;
        x+=lowbit(x);
    }
}
 
int sum(int x)
{
    int res=0;
    while(x>0)
    {
        res+=c[x];
        x-=lowbit(x);
    }
    return res;
}
 
int main()
{
    int t;
    char s[MAXN];
    int i,j;
    int o,l,r,k;
    char ch;
    scanf("%d",&t);
    for(j=1;j<=t;j++)
    {
        scanf("%d%d",&n,&m);
        scanf("%s",s);
        memset(c,0,sizeof(c));
        for(i=2;i<n;i++)
            if(s[i]=='w'&&s[i-1]=='b'&&s[i-2]=='w')
                add(i+1,1);
        printf("Case %d:\n", j);
        for(i=0;i<m;i++)
        {
            scanf("%d",&o);
            if(o==0)
            {
                scanf("%d %d",&l,&r);
                l++,r++;
                if(l>r)
                    swap(l,r);
                if(r-l<2)
                    printf("0\n");
                else
                    printf("%d\n",sum(r)-sum(l+1));
            }
            if(o==1)
            {
                scanf("%d %c",&k,&ch);
                if(s[k]==ch)
                    continue;
                if(k-2>=0&&k<=n-1)
                {
                    if(s[k]=='w'&&s[k-1]=='b'&&s[k-2]=='w')
                        add(k+1,-1);
                    if(ch=='w'&&s[k-1]=='b'&&s[k-2]=='w')
                        add(k+1,1);
                }
                if(k-1>=0&&k+1<=n-1)
                {
                    if(s[k-1]=='w'&&s[k]=='b'&&s[k+1]=='w')
                        add(k+2,-1);
                    if(s[k-1]=='w'&&ch=='b'&&s[k+1]=='w')
                        add(k+2,1);
                }
                if(k+2<=n-1)
                {
                    if(s[k]=='w'&&s[k+1]=='b'&&s[k+2]=='w')
                        add(k+3,-1);
                    if(ch=='w'&&s[k+1]=='b'&&s[k+2]=='w')
                        add(k+3,1);
                }
                s[k]=ch;
            }
        }
    }
    return 0;
}