CF 597C. Subsequences(树状数组优化DP)

链接

题意：

n个数让你取$m+1$个递增元素。问方案数？

分析：

毫无疑问DP来做但是DP来做是$O(n^{2}m)$的复杂度肯定过不去，那么我么你转变思路，用$dp[i][j]$表示以i结尾，长度为j的方案数，那么他状态由$dp[小于i][j-1]$
转移过来，那么我们只要维护出来小于一个数数量有多少就可降低复杂度。那么我们就可以用树状数组维护。先维护出m+1个树状数组然后找每一个小于其前一状态。

状态转移方程是:$dp[i][j]=dp[<i]][j-1]$.

// Problem: C. Subsequences
// Contest: Codeforces - Testing Round #12
// URL: https://codeforces.com/problemset/problem/597/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
 
#define x first
#define y second
#define sf scanf
#define pf printf
#define PI acos(-1)
#define inf 0x3f3f3f3f
#define lowbit(x) ((-x)&x)
#define mem(a,x) memset(a,x,sizeof(a))
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<=(b);++i)
#define repr(i,b,a) for(int i=int(b);i>=(a);--i)
#define debug(x) cout << #x << ": " << x << endl;
 
const int MOD = 998244353;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;	
const int dx[] = {0, 1, -1, 0, 0};
const int dy[] = {0, 0, 0, 1, -1};
const int dz[] = {1, -1, 0, 0, 0, 0 };
int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
 
ll n,m;
ll a[maxn];
ll tree[maxn][20],dp[maxn][20];

void update(ll num,ll x,ll d){
	while(x<=n){
		tree[x][num]+=d;
		x+=lowbit(x);
	}
}
ll query(ll num,ll x){
	ll ans=0;
	while(x){
		ans+=tree[x][num];
		x-=lowbit(x);
	}
	return ans;
}
void solve()
{
	scanf("%lld%lld",&n,&m);
	m++;
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);		
	}
	update(0,1,1);
	for(int i=1;i<=n;i++){
		for(int j=m;j>=1;j--){
			ll tmp=query(j-1,a[i]);
			dp[a[i]][j]+=tmp;
			update(j,a[i],dp[a[i]][j]);
		}
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		ans+=dp[i][m];		
	}
	printf("%lld\n",ans);
}
 
int main()
{
    ll t = 1;
    //scanf("%lld",&t);
    while(t--)
    {
        solve();
    }
    return 0;
}