湘潭oj 1247 Pair-Pair

a[i] < b[i], a[i] = b[i], a[i] > b[i]分别建一个树状数组, 保存的a[i]的值的数量.
查询的时候分情况讨论:
例如: a[i] < b[i] < a[j] < b[j], LIS为4, 查询 < 的树状数组中, b[i] < a[j]的有多少个.
特殊情况: (a[i] < b[i]) > (a[j] < b[j])
这个时候LIS可能为3或者2;
新建一个树状数组保存bi的个数, 按照 b 排序, 枚举 j, 查询前面有多少b[i] > a[j], 同时对于b[i] == b[j]的情况, 按照 a 排序, 算一下.
这样得到的是 a[i] < a[j] < b[i] < b[j] || a[j] < a[i] < b[i] < b[j] 以及 a[i] < a[j] < b[i] == b[j]的LIS为3的情况
还要统计 a[i] < a[j] < b[j] < b[i], 这个时候LIS也是3.

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

#define ls i << 1
#define rs ls | 1
#define md (ll + rr >> 1)
#define N 100020
#define M 1020
#define LL long long

int n, m, tot;
int f[6][M], ch[N*30][2], sum[N*30], rt[N];
int a[N], b[N];
vector<int> vt[M];
void add(int x, int g[], int v){
    for(; x <= m; x += x & -x) g[x] += v;
}
int query(int x, int g[]){
    int ret = 0;
    for(; x > 0; x -= x & -x) ret += g[x];
    return ret;
}
void check(int x, int y, int v){
    if(x < y)
        add(x, f[0], v);
    else if(x == y)
        add(x, f[1], v);
    else
        add(x, f[2], v);
}
LL g[10];
int main(){
    while(scanf("%d%d", &n, &m) != EOF){
        memset(f, 0, sizeof f);
        memset(g, 0, sizeof g);
        memset(sum, 0, sizeof sum);
        memset(ch, 0, sizeof ch);
        m += 5;
        int cc = 0;
        for(int i = 1; i <= m; ++i) vt[i].clear();
        for(int i = 1; i <= n; ++i){
            scanf("%d%d", &a[i], &b[i]);
            check(a[i], b[i], 1);
            if(a[i] < b[i])
                cc++, vt[b[i]].push_back(a[i]);
        }
        LL all = 1LL * cc * cc;
        for(int i = 1; i <= n; ++i){
            //check(a[i], b[i], -1);
            if(a[i] < b[i]){
                g[4] += query(m, f[0]) - query(b[i], f[0]);
                all -= query(m, f[0]) - query(b[i], f[0]);
                g[3] += query(m, f[1]) - query(b[i], f[1]);
                g[3] += query(m, f[2]) - query(b[i], f[2]);

                g[3] += query(b[i], f[0]) - query(b[i] - 1, f[0]);
                all -= query(b[i], f[0]) - query(b[i] - 1, f[0]);
                g[2] += query(b[i], f[1]);
                g[2] += query(b[i], f[2]);
            }
            else if(a[i] == b[i]){
                g[3] += query(m, f[0]) - query(b[i], f[0]);
                g[2] += query(m, f[1]) - query(b[i], f[1]);
                g[2] += query(m, f[2]) - query(b[i], f[2]);

                g[2] += query(b[i], f[0]);
                g[1] += query(b[i], f[1]);
                g[1] += query(b[i], f[2]);
            }
            else{
                g[3] += query(m, f[0]) - query(b[i], f[0]);
                g[2] += query(m, f[1]) - query(b[i], f[1]);
                g[2] += query(m, f[2]) - query(b[i], f[2]);

                g[2] += query(b[i], f[0]);
                g[1] += query(b[i], f[1]);
                g[1] += query(b[i], f[2]);
            }
            //check(a[i], b[i], 1);
        }
        tot = rt[0] = 0;
        for(int i = 1; i <= m; ++i){
            sort(vt[i].begin(), vt[i].end());
            int k = 0;
            for(int j = 0; j < vt[i].size(); ++j){
                int ret = query(m, f[3]) - query(vt[i][j], f[3]);
                g[3] += ret;
                all -= ret;
                if(j > 0 && vt[i][j] != vt[i][j-1])
                    k = j;
                g[3] += k;
                all -= k;
            }
            add(i, f[3], vt[i].size());
        }
        for(int i = 1; i <= m; ++i){
            for(int j = 0; j < vt[i].size(); ++j){
                int ret = query(m, f[4]) - query(vt[i][j], f[4]);
                g[3] += ret;
                all -= ret;
            }
            for(int j = 0; j < vt[i].size(); ++j)
                add(vt[i][j], f[4], 1);
        }
        g[2] += all;
        cout << g[1] << " " << g[2] << " " << g[3] << " " << g[4] << endl;
    }
    return 0;
}