hdu4046panda

http://acm.hdu.edu.cn/showproblem.php?pid=4046
单点更新，区间求和，可以用树状数组，存wbw字符的组合

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn=50005;
int c[maxn];
int n;
char letter[maxn];
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 ret=0;