Cod sursa(job #1713746)
Utilizator | Data | 6 iunie 2016 14:49:47 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
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 n,x,v[100001],i,j,m;
int main()
{
f>>n;
for(i=1; i<=n; i++){ f>>x;
j=1;
while(x>v[j] && j<=m)j++;
v[j]=x;
m=max(m,j);
}
g<<m<<endl;
for(i=1; i<=m; i++)g<<v[i]<<" ";
g<<endl;
return 0;
}