Code no AC

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;
const int mod = 1000000007;

int n, a[N];
vector<vector<int>> bit;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i];
}

int res = 0;

void preproc()
{
    vector<int> b(n+1,inf);
    b[0] =  minf;
    for(int i=1; i<=n; i++)
    {
        int k = lower_bound(b.begin(),b.end(),a[i])-b.begin();
        res = max(res,k);
        b[k] = a[i];
    }
}

void compress()
{
    set<int> s(a+1,a+1+n);
    vector<int> b(s.begin(),s.end());
    for(int i=1; i<=n; i++)
    {
        int x = a[i];
        int k = lower_bound(b.begin(),b.end(),x)-b.begin()+1;
        a[i] = k;
    }
}

void up(int val, int i, int k)
{
    for(; i <= n; i += i & -i) bit[i][k] = (bit[i][k]+val)%mod;
}

int get(int x, int k)
{
    int ans = 0;
    for(; x > 0; x -= x & -x) ans += bit[x][k];
    return ans%mod;
}

int f[N][1005];

void proc()
{
    compress();
    bit.resize(n+2,vector<int>(res+2,0));
    for(int i=1; i<=n; i++)
    {
        for(int k=1; k<=res; k++)
        {
            if (k==1)
            {
                f[i][k] = 1;
                up(f[i][k],a[i],k);
            }
            else{
                f[i][k] = (f[i][k] + get(a[i]-1,k-1))%mod;
                up(f[i][k],a[i],k);
            }
        }
    }
    int ans =0;
    for(int i=res; i<=n; i++) ans = (ans + f[i][res])%mod;
    cout << ans;
}

signed main()
{
    readfile();
    preproc();
    proc();
    return 0;
}