4361: isn

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
using namespace std;
const int N=2017;
const int mod=1e9+7;
int a[N],n,b[N],c[N],top=0,bin[N],f[N];
inline void upd(int& x,int y){x+=y;if(x>=mod)x-=mod;}
struct T{
    int tr[N];
    void A(int x,int d){for(;x<=n;x+=(x&-x))upd(tr[x],d);}
    int Q(int x){int res=0;for(;x;x-=(x&-x))upd(res,tr[x]);return res;}
}tree[N];
int main(){
    scanf("%d",&n);
    rep(i,1,n)scanf("%d",&a[i]),b[i]=a[i];
    sort(b+1,b+n+1);
    rep(i,1,n)if(i==1 || b[i]!=b[i-1])c[++top]=b[i];
    rep(i,1,n)a[i]=lower_bound(c+1,c+top+1,a[i])-c;
    bin[0]=1;rep(i,1,n)bin[i]=1ll*bin[i-1]*i%mod;
    tree[0].A(1,1);
    rep(i,1,n){
        rep2(k,i-1,0){
            int res=tree[k].Q(a[i]);
            upd(f[k+1],res);
            if(res)tree[k+1].A(a[i],res);
        }
    }int ans=0;
    rep(i,1,n){
        int res=(1ll*f[i]*bin[n-i]%mod-1ll*f[i+1]*(i+1)%mod*bin[n-i-1]%mod+2ll*mod)%mod;
        upd(ans,res);
    }
    printf("%d\n",ans);
    return 0;
}

有时要做出一些让步