Pagini recente » Cod sursa (job #2260672) | Cod sursa (job #2325151) | Cod sursa (job #2093807) | Cod sursa (job #2379396) | Cod sursa (job #1126501)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100000], l[100000], imax;
int main()
{
f>>n;
for(int i=0;i<n;i++)
f>>a[i];
l[n] = 1;
for(int k=n-1;k>=1;k--)
{
l[k] = 1;
int i = k;
do
{
i++;
}while(a[k]> a[i]);
if(a[k]<a[i])
l[k] = l[i]+1;
}
int max = -99999999;
for(int i=1;i<=n;i++)
if(max < l[i])
{
imax = i;
max = l[i];
}
max=a[imax];
for(int i=imax + 1;i<=n;i++)
if(a[i]>=max)
{
max = a[i];
g<<max<<' ';
}
return 0;
}