Cod sursa(job #1426370)
| Utilizator | Data | 29 aprilie 2015 16:25:25 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<cstring>
using namespace std;
int a[200000000],i,n,len,maxim,poz,j;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
{
len=0;
for(j=i+1;j<=n;j++)
if(a[i]<=a[j])
{
len++;
}
if(maxim<=len)
{
maxim=len;
poz=i;
}
}
g<<maxim;
g<<"\n";
for(i=poz;i<=maxim+poz-1;i++)
g<<a[i]<<" ";
}
