Cod sursa(job #1704135)
| Utilizator | Data | 18 mai 2016 09:48:09 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.83 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,nr,mx,v[100004],poz,scazut;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
mx=-999;
nr=1;
for(i=1; i<=n; i++)
f>>v[i];
if(n==1) g<<nr<<"\n"<<v[n];
else
{
for(i=2; i<=n; i++)
{
if(v[i]>v[i-1])nr++;
if(v[i]==v[i-1])scazut++;
if(nr>mx)
{
mx=nr;
poz=i;
}
if(v[i]<v[i-1])
{
nr=1;
scazut=0;
}
}
g<<mx<<"\n";
for(i=poz-mx-scazut+1; i<=poz; i++)
{
g<<v[i]<<" ";
if(v[i]==v[i+1])while(v[i]==v[i+1])i++;
}
}
return 0;
}
