k元上升子序列(树状数组)

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=1e4+10;
const int mod=123456789;
int n,m,a[N],tr[N];
int dp[110][N];
/*
长度为i，末尾是a[j]的子序列个数
dp[i][j];
*/
vector<int>b;
int find(int x){
	return lower_bound(b.begin(),b.end(),x)-b.begin();
}
int lowbit(int x){
	return x&(-x);
}
void add(int u,int k){
	while(u<=n){
		tr[u]=(tr[u]+k)%mod;
		u+=lowbit(u);
	}
}
int query(int u){
	int res=0;
	while(u){
		res=(res+tr[u])%mod;
		u-=lowbit(u);
	}
	return res;
}
void solve()
{
	cin>>n>>m;
	b.clear();
	for(int i=1;i<=n;i++){
		cin>>a[i];
		b.push_back(a[i]);
	}
	sort(b.begin(),b.end());
	b.erase(unique(b.begin(),b.end()),b.end());
	for(int i=1;i<=n;i++){
		a[i]=find(a[i])+1;
		dp[1][i]=1;	
	}	
	for(int i=2;i<=m;i++){
		memset(tr,0,sizeof(tr));
		for(int j=1;j<=n;j++){
			dp[i][j]=query(a[j]-1)%mod;
			add(a[j],dp[i-1][j]);
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		ans=(ans+dp[m][i])%mod;
	}
	cout<<ans<<endl;
}

signed main()
{
	ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
	int t; cin>>t;
	while(t--)
{
	solve();
}
	return 0;
}