Fundraising Gym - 101889F

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

带权上升子序列

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <tr1/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 mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#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=1e5+9;
const int mod=1e9+7;


int n;
ll c[maxn*4];
void add(int x,ll val)
{
    while(x<=maxn*4)
    {
        c[x]=max(c[x],val);
        x+=lowbit(x);
    }
}
ll que(int x)
{
    ll ans=0;
    while(x>0)
    {
        ans=max(ans,c[x]);
        x-=lowbit(x);
    }
    return ans;
}

struct node
{
    int b,f;
    ll d;
    bool operator < (const node &o) const
    {
        if(b==o.b) return f>o.f;
        return b<o.b;
    }
}a[maxn],tmp[maxn];
int cnt2=0;
int mp[maxn];
int cnt=0;
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a[i].b>>a[i].f>>a[i].d;
    }

    sort(a,a+n);

    tmp[0].b=a[0].b;
    tmp[0].f=a[0].f;
    tmp[0].d=a[0].d;
    for(int i=1;i<n;i++)
    {
        //cout<<a[i].b<<a[i].f<<a[i].d<<endl;
        if(a[i].b==tmp[cnt2].b&&a[i].f==tmp[cnt2].f)
            tmp[cnt2].d+=a[i].d;
        else
        {
            //cout<<a[i].b<<a[i].f<<a[i].d<<endl;
            cnt2++;
            tmp[cnt2].b=a[i].b;
            tmp[cnt2].f=a[i].f;
            tmp[cnt2].d=a[i].d;

        }
    }

    cnt2++;

    sort(tmp,tmp+cnt2);

    for(int i=0;i<cnt2;i++)
    {
        mp[cnt++]=tmp[i].f;
    }

    sort(mp,mp+cnt);

    int m=unique(mp,mp+cnt)-mp;

    ll ans=0;
    for(int i=0;i<cnt2;i++)
    {
        //cout<<a[i].b<<a[i].f<<a[i].d<<endl;
        int pos=lower_bound(mp,mp+m,tmp[i].f)-mp+1;
        ans=que(pos-1);
        add(pos,tmp[i].d+ans);
    }

    cout<<que(cnt2)<<endl;

    return 0;
}