Color the ball Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8883 Accepted Submission(s): 4542 Problem Description N个气球排成一排，从左到右依次编号为1

题目链接：点击打开链接 //题目大意：一段序列，给连续的一段涂色，问某个点被涂的次数#include <iostream>#include <algorithm>#include <fstream>#include <sstream>#include <iomanip>#include <cstdio>#include <vector>#include <cstring>#i

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1556Problem Description: N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算

树状数组 #include <stdio.h>#include <string.h>const int MAXN=110000;int n,c[MAXN];int lowbit(int x)//计算2^k{x=x&-x;return x;}void update(int num,int val)//向下查询，num是要更新的子节点，val是要修改的值{while(num>