URAL 1523.K-inversions (树状数组)

555，取余之后，有可能出现负数。

/************************************
 * Author : binwin20                *
 * Blog   : blog.csdn.net/binwin20  *
 ************************************/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <map>
#include <stack>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
#include <deque>

#define LL long long
#define DB double
#define SI(a) scanf("%d",&a)
#define SD(a) scanf("%lf",&a)
#define SS(a) scanf("%s",a)
#define PF printf
#define MM(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=a;i<b;i++) 
#define REPD(i,a,b) for(int i=a;i>b;i--)
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define bug puts("bug")
using namespace std;
#define N 20009
int sum[N][11];
int n,k;
const int mod = 1000000000;
int low(int k){
    return k&(-k);
}
int query(int c,int a){
    LL ret = 0;
    for(int i=n;i>0;i-=low(i)){
        ret = ret+sum[i][c];
    }
    for(int i=a;i>0;i-=low(i)){
        ret = ret-sum[i][c];
    }
    return ((ret%mod)+mod)%mod;//因为取余了，这里可能出现负数
}
void  insert(int c,int a,int v){
    for(int i=a;i<N;i+=low(i)){
        sum[i][c] = (v+sum[i][c])%mod;
    }
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    SI(n); SI(k);
    int a;
    REP(i,0,n){
        SI(a);
        insert(1,a,1);
        for(int j=2;j<=k;j++){
            LL c = query(j-1,a);
            insert(j,a,c);
        }
    }
    int ans = query(k,0);
    cout<<ans<<endl;
    return 0;
}