HDU - 1556 Color the ball —— 区间更新 单点查询

Color the ball

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23519    Accepted Submission(s): 11425

Problem Description

N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色吗？

 

Input

每个测试实例第一行为一个整数N,(N <= 100000).接下来的N行，每行包括2个整数a b(1 <= a <= b <= N)。
当N = 0，输入结束。

 

Output

每个测试实例输出一行，包括N个整数，第I个数代表第I个气球总共被涂色的次数。

 

Sample Input

3 1 1 2 2 3 3 3 1 1 1 2 1 3 0

 

Sample Output

1 1 1 3 2 1

思路：线段树模板题

①

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define max_ 100010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;

int n;
int c[max_];
void add(int num,int v)
{
	while(num<=n)
	{
		c[num]+=v;
		num += num&(-num);
	}
}
int getsum(int num)
{
	int sum = 0;
	while( num >0 )
	{
		sum+=c[num];
		num -= num&(-num);
	}
	return sum;
}
int main(int argc, char const *argv[])
{
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		memset(c,0,sizeof(c));
		int i,a,b;
		for(i=0;i

②

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define max_ 100010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;

int n;
int c[max_];
void add(int num,int v)
{
	while(num>0)
	{
		c[num]+=v;
		num -= num&(-num);
	}
}
int getsum(int num)
{
	int sum = 0;
	while( num <= n )
	{
		sum+=c[num];
		num += num&(-num);
	}
	return sum;
}
int main(int argc, char const *argv[])
{
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		memset(c,0,sizeof(c));
		int i,a,b;
		for(i=0;i

③

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define max_ 100010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
int num[max_];
int main(int argc, char const *argv[])
{
	int n;
	while(scanf("%d",&n)!=EOF,n!=0)
	{
		memset(num,0,sizeof(num));
		int k=n;
		while(n--)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			num[a]++;
			num[b+1]--;
		}
		int sum=0;
		for(int i=1;i