CodeForces 652D :Nested Segments 思维 + 树状数组

传送门

题意

给你$n$条闭区间的线段，求每条能够包含的线段的数量

分析

考虑固定一维，将线段的左端点从大到小排序，那么被包含的线段一定是访问过的，右端点小于当前访问线段右端点的线段，离散化之后用树状数组维护即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 4e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
    int l,r;
    int id;
}a[N];
int n;
int tr[N];
VI nums;
int ans[N];

int find(int x){
    return lower_bound(all(nums),x) - nums.begin() + 1;
}

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

void add(int x,int c){
    for(int i = x;i < N;i += lowbit(i)) tr[i] += c;
}

int sum(int x){
    int res = 0;
    for(int i = x;i;i -= lowbit(i)) res += tr[i];
    return res;
}

bool cmp(Node A,Node B){
    if(A.l != B.l) return A.l > B.l;
    return A.r < B.r; 
}

int main() {
    read(n);    
    for(int i = 1;i <= n;i++) read(a[i].l),read(a[i].r),a[i].id = i,nums.pb(a[i].l),nums.pb(a[i].r);
    sort(all(nums));
    nums.erase(unique(all(nums)),nums.end());
    for(int i = 1;i <= n;i++) a[i].l = find(a[i].l),a[i].r = find(a[i].r);
    sort(a + 1,a + 1 + n,cmp);
    for(int i = 1;i <= n;i++){
        ans[a[i].id] = sum(a[i].r);
        add(a[i].r,1);
    }
    for(int i = 1;i <= n;i++) di(ans[i]);
    return 0;
}