hdu1556 Color the ball
2013-08-07 19:00
309 查看
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 100100; int n; int value[maxn]; int res[maxn]; int main() { int a, b; while(scanf("%d", &n) != EOF && n) { for(int i = 0; i <= n; i++) { value[i] = 0; res[i] = 0; } for(int i = 1; i <= n; i++) { scanf("%d%d", &a, &b); value[a] += 1; value[b+1] += -1; } int result = 0; for(int i = 1; i <= n; i++) { result += value[i]; res[i] = result; } for(int i = 1; i < n; i++) { printf("%d ", res[i]); } printf("%d\n", res ); } return 0; }
相关文章推荐
- 【树状数组-区间更新】hdu1556 Color the ball
- HDU1556 Color the ball
- 数据结构之线段树 入门HDU1556 color the ball
- 入门题 - HDU1556 Color the ball
- hdu1556-color the ball 线段树
- Color the ball||HDU1556
- HDU1556 Color the ball
- hdu1556 Color the Ball
- [树状数组]HDU1556 Color the ball
- hdu1556 Color the ball(线段树区间更新)
- hdu1556 D - Color the ball
- hdu1556 Color the ball
- hdu1556 Color the ball 线段树,成段更新水题
- hdu1556 Color the ball
- HDU1556 Color the ball(线段树)
- hdu1556 Color the ball
- hdu1556 Color the ball 线段树
- 【HDU1556】Color the ball(树状数组)
- HDU1556 Color the ball (树状数组)
- hdu1556 color the ball