Cod sursa(job #711425)
| Utilizator | Data | 12 martie 2012 08:43:15 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100000],n,i,k,q,j,maxim,p;
int main()
{f>>n;
maxim=-32000;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
{k=0;
for(j=i+1;j<=n;j++)
{if(v[j]<=v[j+1])
k++;
else k=0;
if(k>maxim)
{maxim=k;
q=i;
p=j;}}
}
g<<maxim<<endl;
for(i=q+1;i<=p+1;i++)
if(v[i]!=v[i-1])
g<<v[i]<<" ";
f.close();
g.close();
}
