Cod sursa(job #1981635)
Utilizator | Data | 16 mai 2017 12:26:16 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n,A[100001],a,x;
int main()
{
fi>>n;
for(int i=1;i<=n;i++)
{
fi>>x;
int *p=lower_bound(A+1,A+a+1,x);
if(p==A+a+1)
A[++a]=x;
else
A[p-A]=x;
}
fo<<a<<"\n";
for(int i=1;i<=a;i++)
fo<<A[i]<<" ";
fi.close();
fo.close();
return 0;
}