分析
dp + 树状数组优化
树状数组长度为j的严格上升子序列的个数;
树状数组同时就是dp数组了,不用再搞一个dp…
注意它这里dp的表示是以i结尾的!
代码
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
#include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double>> PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 1e6 + 7;
const int N = 2010 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
int n,k;
struct node
{
int v;
int id;
int h;
}no[maxn];
int a[maxn];
ll tr[15][maxn];
void update(int x,int v,ll tree[])
{
while(x <= n)
{
tree[x] = (tree[x] + v) % mod;
x += lowbit(x);
}
}
ll query(int x,ll tree[])
{
ll ans = 0;
while(x)
{
ans = (ans + tree[x]) % mod;
x -= lowbit(x);
}
return ans;
}
bool cmp1(node no1,node no2)
{
return no1.v < no2.v;
}
bool cmp2(node no1,node no2)
{
return no1.id < no2.id;
}
map<int,int> mp;
int idx = 1;
int main()
{
iire(n,k);
for(int i=1;i<=n;i++) ire(no[i].v), no[i].id = i;
sort(no+1,no+1+n,cmp1);
//离散
for(int i=1;i<=n;i++)
{
if(!mp[no[i].v]) mp[no[i].v] = idx++;
no[i].h = mp[no[i].v];
}
sort(no+1,no+1+n,cmp2);
for(int i=1;i<=n;i++) a[i] = no[i].h;
ll ans = 0;
for(int i=1;i<=n;i++)
{
update(a[i],1,tr[1]);
for(int j=2;j<=k;j++)
{
ll v = query(a[i]-1,tr[j-1]);
update(a[i],v,tr[j]);
if(j == k) ans = (ans + v) % mod;
}
}
cout<<ans<<endl;
return 0;
}