Cod sursa(job #2151134)
Utilizator | Data | 4 martie 2018 09:44:23 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#define DMAX 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[DMAX], s[DMAX], n, lmax, i, j, m;
int main(){
fin>>n;
for(int i=0; i<n; i++){
fin>>v[i];
j=1;
while(s[j]<v[i] && j<=lmax)
j++;
s[j]=v[i];
lmax=max(lmax, j);
}
fout<<lmax<<"\n";
for(i=1; i<=lmax; i++)
fout<<s[i]<<" ";
return 0;
}