POJ 2352 Stars

Posted on Edited on In 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;
const int N = 15000;
int ans[N];
int n, x, y;

int main() {
    scanf("%d", &n);
    vector<int> xs;
    for (int i = 0; i < n; ++i) {
        scanf("%d%d", &x, &y);
        vector<int>::iterator it = upper_bound(xs.begin(), xs.end(), x);
        int idx = it - xs.begin();
        ++ans[idx];
        xs.insert(it, x);
    }
    for (int i = 0; i < n; ++i)
        printf("%d\n", ans[i]);
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <cstdio>

using namespace std;
const int N = 15000, X = 32002;
int ans[N], tree[X << 2];
int n, x, y;

void update(int p, int l, int r, int x) {
    if (l == r) {
        ++tree[p];
        return;
    }
    int mid = l + r >> 1;
    if (x <= mid) update(p * 2, l, mid, x);
    else update(p * 2 + 1, mid + 1, r, x);
    tree[p] = tree[p * 2] + tree[p * 2 + 1];
}

int query(int p, int l, int r, int i, int j) {
    if (i <= l && r <= j) return tree[p];
    int mid = l + r >> 1, sum = 0;
    if (i <= mid) sum += query(p * 2, l, mid, i, j);
    if (j > mid) sum += query(p * 2 + 1, mid + 1, r, i, j);
    return sum;
}

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d%d", &x, &y);
        ++x;
        ++ans[query(1, 1, X - 1, 1, x)];
        update(1, 1, X - 1, x);
    }
    for (int i = 0; i < n; ++i)
        printf("%d\n", ans[i]);
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <cstdio>

using namespace std;
const int N = 15000, X = 32002;
int c[X], ans[N];
int n, x, y;

int lowbit(int x) {
    return x & -x;
}

int add(int i, int k) {
    while (i <= X) {
        c[i] += k;
        i += lowbit(i);
    }
}

int query(int i) {
    int s = 0;
    while (i > 0) {
        s += c[i];
        i -= lowbit(i);
    }
    return s;
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &x, &y);
        ++x;
        add(x, 1);
        ++ans[query(x) - 1];
    }
    for (int i = 0; i < n; ++i)
        printf("%d\n", ans[i]);
    return 0;
}