SDUT 3332 下一较大值（一）

点击打开链接

#include <bits/stdc++.h>
using namespace std;

int _stack[100100], pp[100100];

int main()
{
int n, m;
int i, j, k;
cin >> n;
for(j = 1; j <= n; j++)
{
memset(_stack, 0, sizeof(_stack));
cin >> m;
for(int i = 1; i <= m; i++)
{
cin >> pp[i];
}
for(i = 1; i < m; i++)
{
for(k = i+1; k <= m; k++)
{
if(pp[i] <= pp[k])
{
_stack[i] = pp[k];
break;
}
}
if(k > m)
{
_stack[i] = -1;
}
}
_stack[m] = -1;
for(i = 1; i <= m; i++)
{
cout << pp[i] << "-->" << _stack[i] << endl;
}
if(j != n)
{
cout << endl;
}
}
return 0;
}