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;
}




HDU4046--Panda(树状数组)的更多相关文章

  1. hdu 4046 Panda 树状数组

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4046 When I wrote down this letter, you may have been ...

  2. BZOJ 1103: [POI2007]大都市meg [DFS序 树状数组]

    1103: [POI2007]大都市meg Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 2221  Solved: 1179[Submit][Sta ...

  3. bzoj1878--离线+树状数组

    这题在线做很麻烦,所以我们选择离线. 首先预处理出数组next[i]表示i这个位置的颜色下一次出现的位置. 然后对与每种颜色第一次出现的位置x,将a[x]++. 将每个询问按左端点排序,再从左往右扫, ...

  4. codeforces 597C C. Subsequences(dp+树状数组)

    题目链接: C. Subsequences time limit per test 1 second memory limit per test 256 megabytes input standar ...

  5. BZOJ 2434: [Noi2011]阿狸的打字机 [AC自动机 Fail树 树状数组 DFS序]

    2434: [Noi2011]阿狸的打字机 Time Limit: 10 Sec  Memory Limit: 256 MBSubmit: 2545  Solved: 1419[Submit][Sta ...

  6. BZOJ 3529: [Sdoi2014]数表 [莫比乌斯反演 树状数组]

    3529: [Sdoi2014]数表 Time Limit: 10 Sec  Memory Limit: 512 MBSubmit: 1399  Solved: 694[Submit][Status] ...

  7. BZOJ 3289: Mato的文件管理[莫队算法 树状数组]

    3289: Mato的文件管理 Time Limit: 40 Sec  Memory Limit: 128 MBSubmit: 2399  Solved: 988[Submit][Status][Di ...

  8. 【Codeforces163E】e-Government AC自动机fail树 + DFS序 + 树状数组

    E. e-Government time limit per test:1 second memory limit per test:256 megabytes input:standard inpu ...

  9. 【BZOJ-3881】Divljak AC自动机fail树 + 树链剖分+ 树状数组 + DFS序

    3881: [Coci2015]Divljak Time Limit: 20 Sec  Memory Limit: 768 MBSubmit: 508  Solved: 158[Submit][Sta ...

随机推荐

  1. SQL语句查询表中的所有约束

    select * from sysobjects where parent_obj in(select id from sysobjects where name='表名') 或者 exec sp_h ...

  2. ajax+php(环境搭建+测试)

    在学习JavaScript,jQuery的ajax部分的时候,一直不明白要如何进行,不知道服务器要怎么弄,什么都不知道,当初在学ajax的时候,除了看一下ajax的内容,实践极少,因为,不知道要怎么做 ...

  3. Just a Hook(区间set)

    Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total ...

  4. Android 开发笔记___RadioButton

    horizontal <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" and ...

  5. BPF漫谈

    源起 最近看到国内两篇文章[1][2]先后翻译了就职于Netflix的性能分析大牛Brendan Gregg于2017年7月31日写的<Golang bcc/BPF Function Traci ...

  6. 三星R428 内存不兼容金士顿2G DDR3

    京东上买了个金士顿2G DDR3, 回家装上之后发现不兼容, 原机带的是三星DDR3 1066的2G条子,买的是 金士顿DDR3 2G 1333的条子,结果单独插任何一根都好使,两个插槽均无问题,但是 ...

  7. Minix3信号处理分析

    进程的信号处理的相关结构 PM中存放着所有进程的进程描述符,在一个进程描述符中,有一个指针,指向一个sigaction结构二维数组中的一项,表示这个进程所有信号的操作.一个sigaction结构包含信 ...

  8. Qemu 简述

    Qemu 架构 Qemu 是纯软件实现的虚拟化模拟器,几乎可以模拟任何硬件设备,我们最熟悉的就是能够模拟一台能够独立运行操作系统的虚拟机,虚拟机认为自己和硬件打交道,但其实是和 Qemu 模拟出来的硬 ...

  9. 深入理解立即执行函数(function(){})();

    ( function(){-} )()和( function (){-} () )是两种javascript立即执行函数的常见写法,要理解立即执行函数,需要先理解一些函数的基本概念. 1,函数声明,函 ...

  10. JavaScript 系统知识点图库

    JavaScript 是世界上最流行的,轻量级的编程语言. 这门语言可用于 HTML 和 web,更可广泛用于服务器.PC.笔记本电脑.平板电脑和智能手机等设备: JavaScript 被数百万计的网 ...