Cod sursa(job #1163868)
| Utilizator | Data | 1 aprilie 2014 17:50:50 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100004],i,j,mx,poz,m,k,n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)fin>>v[i];
mx=1;poz=1;k=1;
for(i=2;i<=n;i++)
{
if(v[i]>=v[i-1])k++;
else if(v[i]<v[i-1])k=1;
if(k>mx)mx=k,poz=i-k+1;
}
fout<<mx<<'\n';
for(i=poz;i<poz+mx;i++)fout<<v[i]<<' ';
return 0;
}