CodeForces 315E Sereja and Subsequences （权值线段树+DP）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxm=1e6+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,a[maxn];
ll dp[maxn],ans=0;
ll tree[maxm<<2];
void update(lrt,int pos,ll val){
    if(l==r){
        tree[rt]=val%mod;
        return ;
    }
    int mid=l+r>>1;
    if(pos<=mid) update(lson,pos,val);
    else update(rson,pos,val);
    tree[rt]=(tree[rt<<1]+tree[rt<<1|1])%mod;
}
int query(lrt,int L,int R){
    if(L<=l&&r<=R) return tree[rt];
    int mid=l+r>>1,ans=0;
    if(L<=mid) ans=(ans+query(lson,L,R))%mod;
    if(mid<R) ans=(ans+query(rson,L,R))%mod;
    return ans;
}

int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n;
    rep(i,1,n+1) cin>>a[i];
    update(0,maxm,1,0,1);
    rep(i,1,n+1){
        dp[i]=1LL*a[i]*query(0,maxm,1,0,a[i])%mod;
        update(0,maxm,1,a[i],dp[i]);
    }
    cout<<(tree[1]-1+mod)%mod<<"\n";
    return 0;
}