题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度分析:blablabla
C++ 代码
#include <iostream>
using namespace std;
const int N = 100010;
int n;
int a[N];
int stack[N], top;
int main()
{
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> a[i];
for (int i = 0; i < n; i ++ )
{
bool has_cout = false;
for (int j = top; j > 0; j -- )
if (stack[j] < a[i])
{
printf("%d ", stack[j]);
has_cout = true;
break;
}
if (!has_cout){
cout << "-1" << ' ';
top=0;
}
stack[++top]=a[i];
}
return 0;
}
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度分析:blablabla
C++ 代码
blablabla