Cod sursa(job #1322675)
| Utilizator | Data | 20 ianuarie 2015 11:44:39 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main()
{
int n,v[100000],i,j,s=0,maxx=-1,flag,k,kb=0,x;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
for(i=1; i<n; i++)
{ s=0;
flag=0;
for(j=i+1; j<=n&&flag==0; j++)
{
if(v[j-1]<v[j]) s++;
else
if(maxx<s) {maxx=s;
kb=i;
flag=1;}
}
}
s=0;
for(i=kb;i<n;i++)
if(v[i]<=v[i+1]) s++;
out<<s<<endl;
while(s>=0)
{ x=v[kb-1];
if(x!=v[kb])
out<<v[kb]<<" ";
kb++;
s--;}
return 0;
}
