Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10745 Accepted Submission(s): 5414
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,输入结束。
当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
Author
8600
Source
Recommend
LL
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(new BufferedInputStream(System.in));
while(cin.hasNext()) {
int n = cin.nextInt();
if(n == 0) break;
int[] array = new int[n + 1];
for(int i = 0; i<n; i++) {
int a = cin.nextInt();
int b = cin.nextInt();
update(array, b, 1);
update(array, a - 1, -1);
}
StringBuilder builder = new StringBuilder();
for(int i = 1; i<n; i++) {
builder.append(sum(i, array)).append(" ");
}
System.out.println(builder.append(sum(n, array)).toString());
}
cin.close();
}
private static void update(int[] array, int a, int b) {
while(a > 0) {
array[a] += b;
a -= (a & (-a));
}
}
private static int sum(int n, int[] array) {
int result = 0;
while(n < array.length) {
result += array[n];
n += (n & (-n));
}
return result;
}
}