Cod sursa(job #1126986)
| Utilizator | Data | 27 februarie 2014 10:42:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
long v[100001], q[100001], n, l=0;
ifstream fin("scmax.in"); ofstream fout("scmax.out");
int main(){
int i, j, ok;
fin>>n;
for(i=1; i<=n; i++){fin>>v[i]; ok=0;
for(j=1; j<=l; j++)
if(q[j]>=v[i]){q[j]=v[i];
ok=1;
break;}
if(!ok)q[++l]=v[i];}
fout<<l<<"\n";
for(i=1; i<=l; i++)
fout<<q[i]<<" ";
fin.close(); fout.close();
return 0;}
