LightOj 1085.cpp

// Problem name : 1085 - All Possible Increasing Subsequences
// Algorithm : BIT
// Contest/Practice : Off Line Practice
// Source : Light Oj
// Comment : Whenever you start to believe  yourself, people also start to believe in you
// Date : 09-Oct-14

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<assert.h>


#define pause system("pause")
#define FOR(s,e,inc) for(int i=s;i<=e;i+=inc)
#define mod 1000000007
#define inf 1<<30
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define F first
#define S second
#define sz(x) ((int)x.size())
#define sqr(x) ( (x)* (x) )
#define eps 1e-9
#define gcd(x,y) __gcd(x,y)
#define on(x,w)  x=x|(1<<w)
#define check(x,w) (x&(1<<w))==(1<<w)?true:false
#define all(x) (x).begin(),(x).end()
#define pf printf
#define AND &&
#define OR ||

typedef long long ll;
typedef unsigned long long ull;

using namespace std;


template<class T>
inline T mod_v(T num)
{
    if(num>=0)
        return num%mod;
    else
        return (num%mod+mod)%mod;
}

template<class T>
inline void memset1(vector<T>&v,int s,T value)
{
    for(int i=0;i<s;i++)
        v[i]=value;
}

template<class T>
inline void memset2(vector<vector<T> >&v,int s1,int s2,T value)
{
    for(int i=0;i<s1;i++)
        for(int j=0;j<s2;j++)
            v[i][j]=value;
}


template<class T>
T fast_pow(T n , T p)
{
    if(p==0) return 1;
    if(p%2)
    {
        T g=mod_v ( mod_v(n) * mod_v(fast_pow(n,p-1)) );
        return g;
    }
    else
    {
        T g=fast_pow(n,p/2);
        g=mod_v( mod_v(g) * mod_v(g) ) ;
        return g;
    }
}

template<class T>
inline T modInverse(T n)
{
    return fast_pow(n,mod-2);
}

template<class T>
inline void debug(string S1,T S2,string S3)
{
    cout<<S1<<S2<<S3;
}

#ifndef ONLINE_JUDGE
#  define p(x) cout<<x<<endl;
#else if
#  define print(x) 0;
#endif

//.......Code start from here ! .......

class nod
{
    public:
    int v;int idx;
};

bool cmp(nod a,nod b)
{
    if(a.v!=b.v) return a.v<b.v;

    return a.idx>b.idx;
}

nod kp[100005];
ll s[100005];
int n;

ll count(int idx)
{
    ll res=0;
    for(;idx>0;idx=idx - (idx & -idx ) )
        res=(res%mod+s[idx]%mod)%mod ;

    return res;
}

void add(int idx,ll res)
{
    for(;idx<=n; idx=idx + (idx & -idx ))
        s[idx]=(res%mod+s[idx]%mod)%mod ;
}

int main()
{
    int t,tcase=1;

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);

       // kp[0].v=kp[0].idx=10000000;

        for(int i=0;i<n;i++)
        {
            scanf("%d",&kp[i].v);
            kp[i].idx=i;
            s[i]=0;
        }
        s[n]=0;
        sort(kp,kp+n,cmp);

        for(int i=0;i<n;i++)
        {//printf("%d %d\n",kp[i].idx,kp[i].v);
            add(kp[i].idx+1,count(kp[i].idx+1)+1);
        }
        printf("Case %d: %lld\n",tcase++,count(n)%mod);

    }

    return 0;
}