Cod sursa(job #1091460)
| Utilizator | Data | 25 ianuarie 2014 18:30:44 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{ifstream f("scmax.in");
ofstream g("scmax.out");
int n,x[100000],i,max,poz,nr,p,j;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
max=0; poz=0;
for(i=n-1;i>=1;i--)
{nr=1; p=i;
for(j=i+1;j<=n;j++)
if(x[p]<x[j])
{nr++;
p=j;
}
if(nr>max)
{max=nr;
poz=i;
}
}
g<<x[poz]<<" ";
p=poz;
for(i=poz+1;i<=n;i++)
if(x[p]<x[i])
{g<<x[i]<<" ";
p=i;
}
}
