牛客练习赛56 C ( 动规 + 树状数组 )

题目链接：

#define first f
#define second s
#define ll long long
#define mp make_pair
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxn=1e6+5;
const int inf=0x3f3f3f3f;
const int MOD=998244353;
const double PI=acos(-1);
const double e=2.718281828459;

pii p[maxn];
int cnt[maxn][12],n,k;
int lowbit(int x){return x&(-x);}
void modify(int kth,int x,int val)
{
    for(int i=x;i<=n;i+=lowbit(i)){
        cnt[i][kth]=(cnt[i][kth]+val)%MOD;
    }
}
int getsum(int kth,int x)
{
    int ans=0;
    for(int i=x;i>0;i-=lowbit(i)){
        ans=(ans+cnt[i][kth])%MOD;
    }
    return ans;
}
bool cmp(pii a,pii b)
{
    if(a.f!=b.f){return a.f<b.f;}
    return a.s>b.s;
}
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&p[i].f);p[i].s=i;
    }
    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++){
        modify(1,p[i].s,1);
        for(int j=2;j<=k;j++){
            modify(j,p[i].s,getsum(j-1,p[i].s-1));
        }
    }
    printf("%d\n",getsum(k,n));
    return 0;
}