1 条题解

  • 0
    @ 2024-1-10 10:32:21

    #include<iostream> using namespace std; const int N = 1e7 + 10; int c[N], ans[N]; int n; int lowbit(int x) { return x & -x; } void add(int x, int d) { while (x < N) { c[x] += d; x += lowbit(x); } } int sum(int x) { int res = 0; while (x > 0) { res += c[x]; x -= lowbit(x); } return res; }

    int main() { cin >> n; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; x++; ans[sum(x)]++; add(x, 1); } for (int i = 0; i < n; i++) { cout << ans[i] << endl; } }

    • 1

    信息

    ID
    17
    时间
    1000ms
    内存
    512MiB
    难度
    9
    标签
    递交数
    10
    已通过
    8
    上传者