51nod 2500 后面第一个大于

点击打开链接

#include<bits/stdc++.h>
using namespace std;
const int maxn=3e4+5;
vector<int>G[105];
int main()
{
    int n;
    scanf("%d",&n);
    int a[maxn];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        G[ a[ i ] ].push_back(i);
    }
    for(int i=30;i<=100;i++)
    {
        sort(G[i].begin(),G[i].end());
    }
    for(int i=0;i<n;i++)
    {
        int k=a[i];
        if(i==n-1) printf("0\n");
        else {
            int solve=maxn;
            for(int j=k+1;j<=100;j++)
            {
                int p=upper_bound(G[j].begin(),G[j].end(),i)-G[j].begin();
                if(p==G[j].size()) continue;
                solve=min(solve, G[j][p]-i);
            }
            if(solve==maxn) printf("0 ");
            else printf("%d ",solve);
        }
    }
    return 0;
}