多校第一场——hdu4604——dp

 题意：一次从一个序列里取出一个数放进另一个双端队列里，并且可以随时从这个队列的头和尾弹出元素，同时保证队列里的元素非减。问该队列的长度最大是多少。

计算出以每个位置开始的最长非增子序列和非减子序列的长度，减去重复的元素，取最大值。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

const int maxn = 100000 + 10;
int a[maxn];
int num_up[maxn], num_down[maxn];
int dp_up[maxn], dp_down[maxn];
int n;

void getdp(int * dp, int * num)
{
    dp[n] = 1;
    vector<int> v;
    v.push_back(a[n]);
    vector<int>::iterator iter;
    for(int i = n - 1; i >= 1; --i)
    {
        int sz = v.size();
        if(a[i] > v[sz - 1])
        {
            v.push_back(a[i]);
            dp[i] = sz + 1;
            num[i] = 1;
        }
        else if(a[i] == v[sz - 1])
        {
            dp[i] = sz + 1;
            v.push_back(a[i]);
            pair<vector<int>::iterator, vector<int>::iterator> bounds;
            bounds = equal_range(v.begin(), v.end(), a[i]);
            num[i] = bounds.second - bounds.first;
        }
        else
        {
            iter = upper_bound(v.begin(), v.end(), a[i]);
            dp[i] = iter - v.begin() + 1;
            *iter = a[i];
            pair<vector<int>::iterator, vector<int>::iterator> bounds;
            bounds = equal_range(v.begin(), v.end(), a[i]);
            num[i] = bounds.second - bounds.first;
        }
    }
}

void prework()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", a + i);
    getdp(dp_up, num_up);
    for(int i = 1; i <= n; ++i)
        a[i] = -a[i]; 
    getdp(dp_down, num_down);
}

void solve()
{
    int ans = 0;
    for(int i = 1; i <= n; ++i)
        ans = max(ans, dp_down[i] + dp_up[i] - min(num_up[i], num_down[i]));
    printf("%d\n", ans);
}

int main()
{
    int t; cin >> t;
    while(t--)
    {
        prework();
        solve();
    }
    return 0;
}