样例过不了,求调

#include<iostream>
#include<algorithm>
using namespace std;
const int mod=1e9+7;
template<typename T>inline void read(T &x){
    x=0;T f=1;char ch=getchar();
    while(ch<48||ch>57){if(ch=='-'){f=-1;}ch=getchar();}
    while(ch>=48&&ch<=57){x=x*10+ch-48;ch=getchar();}
    x*=f;
}
#define int long long 
const int N=1e6+9;
int a[N],b[N];
int n;
int last[N],pos[N];
int tot;
struct node{
    int l,r,sum;
    int tag;
}tr[N];
void build(int u,int l,int r){
    tr[u]={l,r,0,0};
    if(l==r) return;
    int mid=l+r>>1;
    build(u<<1,l,mid);
    build(u<<1|1,mid+1,r);
}
void pushdown(int u){
    if(tr[u].tag){
        tr[u<<1].tag+=tr[u].tag;s
        tr[u<<1|1].tag+=tr[u].tag;
        tr[u<<1].sum+=tr[u].tag*(tr[u<<1].r-tr[u<<1].l+1);
        tr[u<<1|1].sum+=tr[u].tag*(tr[u<<1|1].r-tr[u<<1|1].l+1);
        tr[u].tag=0;
    }
}
int query(int u,int l,int r){
    pushdown(u);
    if(tr[u].l>=l&&tr[u].r<=r){
        return tr[u].sum;
    }
    int mid=tr[u].l+tr[u].r>>1;
    int res=0;
    if(l<=mid) res+=query(u<<1,l,r);
    if(r>mid) res+=query(u<<1|1,l,r);
    return res;
}
void update(int u,int l,int r,int val){
    pushdown(u);
    if(tr[u].l>=l&&tr[u].r<=r){
        tr[u].sum+=(tr[u].r-tr[u].l+1);
        tr[u].tag+=val;
        return;
    }
    int mid=tr[u].l+tr[u].r>>1;
    if(l<=mid) update(u<<1,l,r,val);
    if(r>mid) update(u<<1|1,l,r,val);
}
signed main(){
    read(n);
    for(int i=1;i<=n;i++){
        read(a[i]);
        b[i]=a[i];
    }
    sort(b+1,b+1+n);
    int tot=unique(b+1,b+1+n)-(b+1);
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(b+1,b+n+1,a[i])-(b+1);
        last[i]=pos[a[i]];
        pos[a[i]]=i;
    }
    build(1,1,n);
    int ans=0;
    int now=0;
    for(int i=1;i<=n;i++){
        // cout<<query(1,last[i]+1,i)<<" ";
        now+=i-last[i]+2*(query(1,last[i]+1,i));
        // cout<<query(1,last[i],i)<<" ";
        now%=mod;
        ans+=now;
        // cout<<last[i+1]<<" "<<i<<" ";
        update(1,last[i]+1,i,1);
        // cout<<query(1,1,1)<<" ";
    }
    cout<<ans%mod<<endl;
    return 0;
}