《ybtoj高效进阶》第四部分第二章例题3 严格上升子序列数

题目大意

如题，多组数据

思路

开多个树状数组优化dp
code:

#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cassert>
#include<cwchar>
#include<cwctype>
#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
using namespace std;
long long n,a[1001],p[1001],m,tree[1001][1001],dp[1001][1001],n2,id,myd=1e9+7;
void add(long long v,long long x)
{
	while (x<=n2)
	{
		tree[id][x]=(tree[id][x]+v)%myd;
		x+=x&-x;
	}
	return;
}
long long QuantAsk(long long x)
{
	long long ans=0;
	while (x)
	{
		ans=(tree[id][x]+ans)%myd;
		x-=x&-x;
	}
	return ans;
}
int main()
{
	long long t;
	cin>>t;
	for (int wj=1;wj<=t;wj++)
	{
		cin>>n>>m; 
		memset(tree,0,sizeof(tree));
		memset(dp,0,sizeof(dp));
		for (int i=1;i<=n;i++) cin>>a[i],p[i]=a[i];
		sort(p+1,p+1+n);
		n2=unique(p+1,p+1+n)-p-1;
		for (int i=1;i<=n;i++)
		{
			a[i]=lower_bound(p+1,p+1+n2,a[i])-p;
		}
		for (int i=1;i<=n;i++) for (int j=1;j<=m;j++)
		{
			if (j==1) dp[i][j]=1;
			else
			{
				id=j;
				dp[i][j]=QuantAsk(a[i]-1)%myd;
			}
			id=j+1;
			add(dp[i][j],a[i]);
		}
		long long ans=0;
		for (int i=m;i<=n;i++) ans=(ans+dp[i][m])%myd;
		cout<<"Case #"<<wj<<": "<<ans<<endl;
	}
	return 0;
}
// cout<<"stoorz AK IOI every day!!!";