hdu 6215(技巧)

题意：给出一个数组，然后将里面连续递减的删去，然后形成一个新的数列，继续这样操作，求最后形成的数列。

PS：北大20分钟过的题最后还是没有过。关键是这个思想确实比较强大。

用一个左右指针，然后更新，然后维护。看了北大队员的代码，自愧不如。

#include<bits/stdc++.h>


using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int N = 2;

int a[maxn],le[maxn],ri[maxn],q[maxn];
bool vis[maxn];

int main()
{
    int Tcase;scanf("%d",&Tcase);
    while(Tcase --)
    {
        int n;scanf("%d",&n);
        for(int i = 1; i <= n;i ++)scanf("%d",&a[i]);
        a[0] = 0;a[n + 1] = maxn;clr(vis,false);
        int l = 1,r = 0;
        for(int i = 1; i <= n;i ++)
        {
            if(a[i] < a[i - 1])
            {
                if(!vis[i - 1]){vis[i - 1] = true,q[++ r] = i - 1;}//cout << i - 1 << " ";}
                vis[i] = true,q[++ r] = i;//cout << i << " ";
            }
            le[i] = i - 1,ri[i] = i + 1;
        }
        while(l <= r)
        {
            int rr = r;
            for(int i = l; i <= rr;i ++)
            {
                le[ri[q[i]]] = le[q[i]];ri[le[q[i]]] = ri[q[i]];
                if(le[q[i]] == 0 || ri[q[i]] == n + 1)continue;
                if(!vis[ri[q[i]]] && a[ri[q[i]]] < a[le[q[i]]])
                {
                    if(!vis[le[q[i]]]){q[++ r] = le[q[i]],vis[le[q[i]]] = true;}//cout << le[q[i]] << " ";}
                    vis[ri[q[i]]] = true,q[++ r] = ri[q[i]];//cout << ri[q[i]] << " ";
                }
            }
            l = rr + 1;
        }
        printf("%d\n",n - r);
        for(int i = 1;i <= n;i ++)if(!vis[i])printf("%d ",a[i]);puts("");
    }
    return 0;
}