uva10534 LISDP

这题是要找一个最长（假设长度为2N-1）的子序列,使得前N个元素递增，后N个元素递减。一个找从前到后的上升子序列，另一个找从后到前的上升子序列（此时用的O(nlogn)的复杂度找的）。最后扫一遍，取两个状态之中较小的，即可找出最长的先上升后下降的子序列。之后 ans = max(ans, min(dp[i],dp[j]) * 2 - 1);全局数组在用的时候一定要初始化~~

/* ***********************************************
Author        :fisty
Created Time  :2014/12/14 22:26:35
File Name     :uva10934.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define MAX_N 10010
const int INF = 0X3f3f3f3f;

int n;
int a[MAX_N];
int g[MAX_N],dp1[MAX_N], dp2[MAX_N];
void solve1(){
    //求a的lis
    for(int i = 0;i < n; i++){
        g[i] = INF;
    }
    for(int i = 0;i < n; i++){
        int k = lower_bound(g, g + n, a[i])-g;
        dp1[i] = k;
        g[k] = a[i];
    }
}
void solve2(){
    //求a的下降最长公共子序列
    for(int i = 0;i < n; i++){
        g[i] = INF;
    }
    for(int i = n-1;i >= 0; i--){
        int k = lower_bound(g, g+n, a[i])-g;
        dp2[i] = k;
        g[k] = a[i];
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%d", &n) != EOF){
        for(int i = 0;i < n; i++){
            scanf("%d", &a[i]);
        }
        memset(dp2, 0 ,sizeof(dp2));
        memset(dp1, 0 ,sizeof(dp1));
        memset(g, 0, sizeof(g));
        solve1();
        solve2();
        //printf("ans1:%d ans2:%d\n",ans1,ans2);
        int ans = 0;
        for(int i = 0;i < n; i++){
            int t = min(dp1[i], dp2[i]);
            ans = max(ans, 2 * t + 1);
        }
        printf("%d\n", ans);
    }
    return 0;
}