【BestCoder】 HDOJ Revenge of LIS II

考虑中间有1种还是多种就行了。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2005
#define maxm 1005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int dp[maxn], a[maxn];
int p[maxn];
int n;

void read(void)
{
    a[0] = dp[0] = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
}

void work(void)
{
    int mx = 0, ans = 0, t, tt;
    for(int i = 1; i <= n; i++) {
        t = -1, tt = 0;
		p[0] = 1;
        for(int j = 0; j < i; j++) {
            if(a[i] > a[j]) {
                if(dp[j] > t) t = dp[j], tt = p[j];
                else if(dp[j] == t) tt = 2;
            }
        }
		p[i] = tt;
        dp[i] = t + 1;
        if(dp[i] > mx) {
            if(tt == 2) mx = ans = dp[i];
            if(tt == 1) ans = mx, mx = dp[i];
        }
        else ans = max(ans, dp[i]);
    }
    printf("%d\n", ans);
}

int main(void)
{
    int _;
    while(scanf("%d", &_)!=EOF) {
        while(_--) {
            read();
            work();
        }
    }
    return 0;
}