Bishops Alliance Gym - 101147F

 https://cn.vjudge.net/problem/Gym-101147F

i-j>=pi^2+pj^2+C    =>    i-pi^2>=j+pj^2+C-1;

最长上升子序列，树状数组维护；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e5+9;
const int mod=1e9+7;

vector<pair<int,ll> >a[2][maxn];
int cnt,len;
ll tmp[maxn];
int tree[maxn];
int n,m;
ll C;
void add(int x,int val)
{
    while(x<=len)
    {
        tree[x]=max(tree[x],val);
        x+=lowbit(x);
    }
}
int getmax(int x)
{
    int ans=0;
    while(x>0)
    {
        ans=max(ans,tree[x]);
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);
    freopen("bishops.in","r",stdin);

    int T;
    //cin>>T;
    sfi(T);
    while(T--)
    {
        scanf("%d%d%I64d",&n,&m,&C);
        for(int i=0;i<2;i++)
        {
            for(int j=0;j<2*n;j++) a[i][j].clear();
        }
        for(int i=1;i<=m;i++)
        {
            int r,c;
            ll p;
            scanf("%d%d%I64d",&r,&c,&p);
            a[0][r-c+n].pb({r,p*p});
            a[1][r+c].pb({r,p*p});
        }

        for(int i=0;i<2;i++)
        {
            for(int j=0;j<2*n;j++)
            {
                sort(a[i][j].begin(),a[i][j].end());
            }
        }

        int ans=0;
        for(int i=0;i<2;i++)
        {
            for(int j=0;j<2*n;j++)
            {
                cnt=0;
                for(int k=0;k<a[i][j].size();k++)
                {
                    int x=a[i][j][k].first;
                    ll pp=a[i][j][k].second;
                    tmp[cnt++]=x-pp;
                    tmp[cnt++]=x+pp+C-1;
                }
                sort(tmp,tmp+cnt);
                len=unique(tmp,tmp+cnt)-tmp;

                for(int k=0;k<=len;k++) tree[k]=0;
                for(int k=0;k<a[i][j].size();k++)
                {
                    int x=a[i][j][k].first;
                    ll pp=a[i][j][k].second;
                    int pos=(lower_bound(tmp,tmp+len,x-pp)-tmp+1);
                    int maxx=getmax(pos);
                    ans=max(ans,maxx+1);
                    pos=(lower_bound(tmp,tmp+len,x+pp+C-1)-tmp+1);
                    add(pos,maxx+1);
                }
            }
        }
        //cout<<ans<<endl;
        printf("%d\n",ans);

    }


    return 0;
}