Cod sursa(job #563934)
| Utilizator | Data | 26 martie 2011 13:44:03 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n,a[100000],i,max=0,lmax=0,b[100000],j;
fi>>n;
for(i=1;i<=n;i++)
fi>>a[i];
for(i=1,j=1;i<=n;i++){
if(a[i]<a[i+1]){
max++;
b[j]=a[i-1];
j++;
}
if(a[i]==a[i+1])
max+=0;
if(a[i]>a[i+1])
max*=0;
if(lmax<=max)
lmax=max;
}
fo<<lmax+1<<'\n';
for(j=1;j<=lmax+1;j++){
fo<<b[j]<<' ';
}
return 0;
}
