Cod sursa(job #1784001)
| Utilizator | Data | 19 octombrie 2016 17:51:50 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.83 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main()
{
int n,v[100001],i,pi,pf,ntc,nta,pfs,pis,ntf,ntc1;
in>>n;
for(i=0;i<n;i++)
in>>v[i];
pi=0;
pf=0;
nta=1;
ntc=1;
pfs=0;
pis=0;
ntf=1;
ntc1=1;
for(i=0;i<n-1;i++)
{
if(v[i]<=v[i+1])
{
pf++;
ntc++;
if(v[i]!=v[i+1])
ntc1++;
}
else
{
pi=pf+1;
nta=ntc;
ntc=1;
pf++;
}
if(nta<ntc)
{
pis=pi;
pfs=pf;
ntf=ntc1;
}
}
out<<ntf<<"\n";
for(i=pis;i<=pfs;i++)
if(v[i]!=v[i+1])
out<<v[i]<<" ";
return 0;
}
