HDU 4991 / BC 8C Ordered Subsequence

题意：求原序列有多少个长度不大于m的上升子序列

注意到m只有100，所以dp即可，对于当前值，左侧比它小的值作为序列末尾有a[i]个长度为i的，则可以推算出以当前值为末尾的有a[i]个长度为i+1的 并且会新形成一个长度为1的

至于如何计算左侧长度为i的可选序列的个数，可以用m个树状数组来维护

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define bug puts("===========");
#define zjc puts("");
const double pi=(acos(-1.0));
const double eps=1e-8;
const ll INF=1e18+10;
const ll inf=1e6+10;
const int mod=123456789;
//const int maxn=100000+10;
/*=======================================*/
const int maxn = 10000 ;
int tree[102][maxn + 10], N;
inline int lowbit(int x) {
    return (x & -x);
}
void add(int id, int x, int v) {
    for (int i = x; i <= N; i += lowbit(i))
        tree[id][i] = (tree[id][i] + v) % mod;
}
int get(int id,int x) {
    int sum = 0;
    for (int i = x; i; i -= lowbit(i))
        sum = (sum + tree[id][i]) % mod;
    return sum;
}
int a[maxn];
vector<int>vec;
map<int,int>mp;
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        for(int i=0;i<=m;i++) mem(tree[i],0);
        vec.clear(); mp.clear();
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            vec.pb(a[i]);
        }
        sort(vec.begin(),vec.end());
        unique(vec.begin(),vec.end());
        for(int i=0;i<vec.size();i++) mp[vec[i]]=i+2;
        N=vec.size()+2;
        add(0,1,1);
        for(int i=0;i<n;i++) {
           a[i]=mp[a[i]];
            int len=min(m,a[i]-1);
            for(int j=0;j<len;j++){
                int x=get(j,a[i]-1);
                add(j+1,a[i],x);
            }
         }
        int ans=get(m,vec.size()+1);
        printf("%d\n",(ans+mod)%mod);
    }
    return 0;
}