Mai intai trebuie sa te autentifici.
Cod sursa(job #2256249)
| Utilizator | Data | 8 octombrie 2018 12:32:11 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100001],N,i,scmax=1,maxx=0,x[100001];
int main()
{
fin>>N;
for(i=1; i<=N; i++)
{
fin>>v[i];
}
int pas=1;
while(pas<N)
{
for(i=1; i<=N; i++)
{
if(v[i]<v[i+pas])
{
scmax++;
x[i]=v[i];
x[i+1]=v[i+1];
}
if(scmax>maxx)
maxx=scmax;
}
pas++;
scmax=1;
}
fout<<maxx<<endl;
i=1;
while(i<N)
{
for(int j=i+1; j<=N; j++)
{
if(x[i]==x[j])
x[j]=0;
}
i++;
}
for(i=1; i<=N; i++)
{
if(x[i]!=0)
fout<<x[i]<<" ";
}
return 0;
}
