A - 数列下标 (暴力遍历) (牛客算法周周练15)

传送门

题意： 需要输出数组a中每一个a[i]右侧第一个比a[i]大的下标。

思路： 原本还以为需要用个单调队列什么的，后来发现其实可以两重循环暴力。最坏都不到1e8的复杂度。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int n;
int a[N], b[N];

signed main()
{
    IOS;

    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    for(int i = 1; i <= n; i ++){
        int ok = 1, pos = -1;
        for(int j = i + 1; j <= n; j ++){
            if(a[j] <= a[i]) continue;
            ok = 0;
            pos = j;
            break;
        }
        if(ok) b[i] = 0;
        else b[i] = pos;
    }
    for(int i = 1; i <= n; i ++)
        cout << b[i] << " ";

    return 0;
}