hdu 4742 Pinball Game 3D（cdq分治+树状数组）

题意：三维的LIS，顺序跟初始的没关系。

跟之前多校那场二维LIS但是顺序是给定的几乎是一个题。只不过这题要算一个情况数。

在按照一维排序后就可以直接利用cdq分治了，合并时用排序加树状数组去维护省下2维即可。

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll __int64
#define ull unsigned __int64
#define eps 1e-8
#define NMAX 10000000000000000LL
#define MOD (1<<30)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
    char c;
    int flag = 0;
    ret=0;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c == '-')
    {
        flag = 1;
        c = getchar();
    }
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
    if(flag) ret = -ret;
}
const int maxn = 100000+10;
struct node
{
    int x,y,z,id;
}no[maxn];
bool cmp1(node a, node b)
{
    if(a.x != b.x) return a.x < b.x;
    if(a.y != b.y) return a.y < b.y;
    return a.z < b.z;
}

bool cmp2(node a, node b)
{
    return a.y < b.y;
}

int dp[maxn];
ll sum[maxn];
node t1[maxn],t2[maxn];

int T[maxn+10];
ll S[maxn+10];
inline int lowbit(int x)
{
    return x&(-x);
}

void add(int x, int d, ll p)
{
    while(x <= maxn)
    {
        if(T[x] == d) S[x] = (S[x]+p)%MOD;
        else if(T[x] < d)
        {
            T[x] = d;
            S[x] = p;
        }
        else break;
        x += lowbit(x);
    }
}
int mx;

ll query(int x)
{
    mx = 0;
    ll ret = 0;
    while(x)
    {
        if(T[x] == mx) ret = (ret+S[x])%MOD;
        else if(T[x] > mx)
        {
            mx = T[x];
            ret = S[x];
        }
        x -= lowbit(x);
    }
    return ret;
}

void cdq(int l, int r)
{
    if(l == r)
    {
        if(dp[l] < 1)
        {
            dp[l] = 1;
            sum[l] = 1;
        }
        return;
    }
    int mid = (l+r)>>1;
    cdq(mid+1,r);
    for(int i = l; i <= mid; i++)
        t1[i] = no[i];
    for(int i = mid+1; i <= r; i++)
        t2[i] = no[i];
    sort(t1+l,t1+mid+1,cmp2);
    sort(t2+mid+1,t2+r+1,cmp2);
    int p = r;
    for(int i = mid; i >= l; i--)
    {
        while(p > mid && t1[i].y <= t2[p].y)
        {
            add(maxn-t2[p].z,dp[t2[p].id],sum[t2[p].id]);
            p--;
        }
        ll ret = query(maxn-t1[i].z);
        if(mx == 0) continue;
        if(mx+1 == dp[t1[i].id]) sum[t1[i].id] = (sum[t1[i].id]+ret)%MOD;
        else if(mx+1 > dp[t1[i].id])
        {
            dp[t1[i].id] = mx+1;
            sum[t1[i].id] = ret;
        }
    }
    p++;
    while(p <= r)
    {
        int x = maxn-t2[p].z;
        while(x <= maxn)
        {
            S[x] = T[x] = 0;
            x += lowbit(x);
        }
        p++;
    }
    cdq(l,mid);
}

int zz[maxn];
int main()
{
#ifdef GLQ
    freopen("input.txt","r",stdin);
//    freopen("o.txt","w",stdout);
#endif
    int _t;
    scanf("%d",&_t);
    while(_t--)
    {
        int n;
        scanf("%d",&n);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d%d%d",&no[i].x,&no[i].y,&no[i].z);
            zz[i] = no[i].z;
            sum[i] = dp[i] = 0;
        }
        sort(zz+1,zz+1+n);
        sort(no+1,no+1+n,cmp1);
        int nct = unique(zz+1,zz+1+n)-(zz+1);
        for(int i = 1; i <= n; i++)
        {
            no[i].z = lower_bound(zz+1,zz+1+nct,no[i].z)-zz;
            no[i].id = i;
        }
        cdq(1,n);
        int ans = 0;
        ll he = 0;
        for(int i = 1; i <= n; i++)
        {
            if(ans == dp[i]) he = (he+sum[i])%MOD;
            else if(ans < dp[i])
            {
                ans = dp[i];
                he = sum[i];
            }
        }
        printf("%d %I64d\n",ans,he);
    }
    return 0;
}