T - Covered Points Count (差分)

You are given n segments on a coordinate line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each other or even coincide.

Your task is the following: for every k∈[1…n], calculate the number of points with integer coordinates such that the number of segments that cover these points equals k. A segment with endpoints li and ri covers point x if and only if li≤x≤ri.

Input
The first line of the input contains one integer n (1≤n≤2⋅105) — the number of segments.

The next n lines contain segments. The i-th line contains a pair of integers li,ri (0≤li≤ri≤1018) — the endpoints of the i-th segment.

Output
Print n space separated integers cnt1,cnt2,…,cntn, where cnti is equal to the number of points such that the number of segments that cover these points equals to i.

Examples
Input
3
0 3
1 3
3 8

Output
6 2 1

Input
3
1 3
2 4
5 7

Output
5 2 0

Note
The picture describing the first example:

Points with coordinates [0,4,5,6,7,8] are covered by one segment, points [1,2] are covered by two segments and point [3] is covered by three segments.

The picture describing the second example:

Points [1,4,5,6,7] are covered by one segment, points [2,3] are covered by two segments and there are no points covered by three segments.

题目大意：
给出n个区间，求出在被这些区间覆盖1次、2次、3次、…、n次的个数

解题思路：
数据范围太大，暴力肯定超时的，用前缀和和差分思想可以巧妙解题，代码不长，看代码理解吧

代码：

#include<iostream>
#include<algorithm>
using namespace std;
pair<long long,long long> a[400010];	//用全局变量，栈内存是不够的 
long long n,m=0,b[200010];
int main()
{
	cin>>n;
	for(int i=0;i<n;i++){
		long long x,y;
		cin>>x>>y;
		a[m].first=x;
		a[m++].second=1;
		a[m].first=y+1;
		a[m++].second=-1;
	}
	sort(a,a+m);		//排序 
	long long d=1;
	for(int i=1;i<m;i++){
		b[d]+=a[i].first-a[i-1].first;		//差分 
		d+=a[i].second;
	}
	for(int i=1;i<=n;i++){
		if(i!=1)cout<<' ';
		cout<<b[i];
	}
	cout<<endl;
}