Cod sursa(job #899057)
| Utilizator | Data | 28 februarie 2013 12:44:10 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
#define N 100001
using namespace std;
int main()
{
int i,li,lf,limax=0,lfmax=0,max=0,nr=1,n;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
long a[N];
for(i=1;i<=n;i++)
f>>a[i];
li=1;
for(i=1;i<=n;i++)
{
if(a[i]<a[i+1])
nr++;
else
if(a[i]>a[i+1])
{
lf=i;
if(nr>max)
{
max=nr;
limax=li;
lfmax=lf;
}
nr=1;
li=i+1;
}
}
g<<max<<endl;
for(i=limax;i<=lfmax;i++)
{
if(a[i]!=a[i+1])
g<<a[i]<<" ";
}
return 0;
}
