Mai intai trebuie sa te autentifici.
Cod sursa(job #1359987)
Utilizator | Data | 25 februarie 2015 10:36:50 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int v[10000],n,i,j,li,lf,vi[10000],vf[10000];
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n;i++)
{
li=1;
for(j=i+1;j<=n;j++)
{
if(v[i]<v[j])
{
vi[li]=v[j];
li++;
}
if(lf<li)
{
lf=li;
vf[0]=v[i];
for(i=1;i<=li;i++)
vf[i]=vi[i];
}
}
}
g<<lf<<endl;
for(i=0;i<lf;i++)
g<<vf[i]<<' ';
g<<endl;
return 0;
}