SDUT 3509 51nod 1276

题目链接：http://www.51nod.com/onlineJudge/questionCode.html#problemId=1276¬iceId=21617

提交：http://sdutacm.org/sdutoj/problem.php?action=showproblem&problemid=3509

#include <bits/stdc++.h>

using namespace std;
const int maxn = 50010;
struct node
{
    int High, pos;

}a[maxn], b[maxn];
int ans[maxn];
bool vis[maxn];
bool cmp(node a, node b)
{
    return a.High < b.High;
}
int main()
{
    int n, m;
    while(~scanf("%d%d",&n,&m)){
        memset(vis, false, sizeof(vis));
        for(int i=0; i<n; i++){
            scanf("%d",&a[i].High);
            a[i].pos = i;
        }
        for(int i=0; i<m; i++){
            scanf("%d",&b[i].High);
            b[i].pos = i;
        }
        sort(a, a+n, cmp);
        sort(b, b+m, cmp);
        int ant = 1;
        int j = 0;
        for(int i=0; i<m; i++){
            while(j < n && a[j].High <= b[i].High){
                if(a[j].pos == 0){
                    if(vis[1]) ant--;
                }
                else if(a[j].pos == n-1){
                    if(vis[n-2]) ant--;
                }
                else{
                    if(!vis[a[j].pos+1] && !vis[a[j].pos-1]) ant++;
                    else if(vis[a[j].pos+1] && vis[a[j].pos-1]) ant--;
                }
                vis[a[j++].pos] = true;
            }
            ans[b[i].pos] = ant;
        }
        for(int i=0; i<m; i++){
            printf("%d\n",ans[i]);
        }
    }
    return 0;
}

/*
5 4
2 1 3 2 3
0 1 3 2
*/