Pagini recente » Cod sursa (job #2035420) | Cod sursa (job #88631) | Cod sursa (job #2651384) | Cod sursa (job #2148884) | Cod sursa (job #2651383)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sclm.in");
ofstream fout("sclm.out");
int sclm[1005], k;
int main()
{
int nr;
fin >> nr;
int x;
fin >> x;
sclm[++ k] = x;
for(int i = 2; i <= nr; i ++)
{
int y;
fin >> y;
if(y > sclm[k])
sclm[++ k] = y;
else
{
int upper = upper_bound(sclm + 1, sclm + k + 1, y) - sclm;
sclm[upper] = y;
}
}
fout << k << "\n";
for(int i = 1; i <= k; i ++)
fout << sclm[i] << " ";
return 0;
}