全连 - dp - BIT - 扫描线

题目大意：有n个三元组$(i,t_i,v_i)$，你要选出一些三元组使得对于任意选出的$(i,t_i,v_i)$和$(j,t_j,v_j),i<j$，满足$i\le j-t_j,i+t_i\le j$，并且对应$v$的和最大。$n\le 10^6$。
题解：这显然dp一下，然后发现这是个二维数点，直接扫描线即可，注意是前缀询问可以BIT。

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define Rep(i,v) rep(i,0,(int)v.size()-1)
#define lint long long
#define ull unsigned lint
#define db long double
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define debug(x) cerr<<#x<<"="<<x
#define sp <<" "
#define ln <<endl
using namespace std;
typedef pair<int,int> pii;
typedef set<int>::iterator sit;
namespace INPUT_SPACE{
    const int BS=(1<<24)+5;char Buffer[BS],*HD,*TL;char gc() { if(HD==TL) TL=(HD=Buffer)+fread(Buffer,1,BS,stdin);return (HD==TL)?EOF:*HD++; }
    inline int inn() { int x,ch;while((ch=gc())<'0'||ch>'9');x=ch^'0';while((ch=gc())>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^'0');return x; }
}using INPUT_SPACE::inn;
const int N=1000010;
int a[N],t[N];
namespace solution0{
    const int N=1010;lint dp[N];
    inline int brute_force_n2(int n)
    {
        rep(i,1,n)
        {
            rep(j,1,i-t[i]) if(j+t[j]<=i) dp[i]=max(dp[i],dp[j]);
            dp[i]+=(lint)t[i]*a[i];
        }
        lint ans=0;
        rep(i,1,n) ans=max(ans,dp[i]);
        return !printf("%lld\n",ans);
    }
}
namespace solution1{
    const int N=1000010;lint dp[N];
    struct Upd{
        int x,pre;
    }u[N];int utop,h[N],n;lint b[N];
    inline int add_upd(int p,int x) { return u[++utop].x=x,u[utop].pre=h[p],h[p]=utop; }
    inline int update(int p,lint v) { for(;p<=n;p+=(p&-p)) b[p]=max(b[p],v);return 0; }
    inline lint query(int p) { lint ans=0;for(;p;p^=(p&-p)) ans=max(ans,b[p]);return ans; }
    inline int brute_force_nlgn(int _n)
    {
        n=_n;
        rep(i,1,n)
        {
            dp[i]=(lint)a[i]*t[i];
            for(int j=h[i],k;j;j=u[j].pre)
                k=u[j].x,update(k,dp[k]);
            if(i-t[i]>0) dp[i]+=query(i-t[i]);
            if(i+t[i]<=n) add_upd(i+t[i],i);
        }
        lint ans=0;
        rep(i,1,n) ans=max(ans,dp[i]);
        return !printf("%lld\n",ans);
    }
}
int main()
{
//  freopen("data.in","r",stdin);
    int n=inn();
    rep(i,1,n) t[i]=inn();
    rep(i,1,n) a[i]=inn();
    if(n<=1000) return solution0::brute_force_n2(n);
    if(n<=1000000) return solution1::brute_force_nlgn(n);
    return 0;
}