Pagini recente » Cod sursa (job #2284236) | Cod sursa (job #1820908) | Cod sursa (job #2556870) | Cod sursa (job #2374808) | Cod sursa (job #2938529)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
const int NMAX = 1e5;
int v[NMAX + 1], ans[NMAX + 1], lung[NMAX + 1], n;
void build(int poz, int l, int val){
if(l == 0)
return;
if(v[poz] <= val && lung[poz] == l){
build(poz - 1, l - 1, v[poz] - 1);
cout << v[poz] << " ";
}else
build(poz - 1, l, val);
}
int cauta(int st, int dr, int x){
int rez = 0;
while(st <= dr){
int mid = ((st + dr) >> 1);
if(ans[mid] < x){
rez = mid;
st = mid + 1;
}else
dr = mid - 1;
}
return rez;
}
int main(){
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
int k = 0, maxi = 0, p = 0;
for(int i = 1; i <= n; i++){
int j = cauta(1, k, v[i]);
if(j == k)
k++;
ans[j + 1] = v[i];
lung[i] = j + 1;
if(maxi < lung[i]){
maxi = lung[i];
p = i;
}
}
cout << maxi << "\n";
build(p, lung[p], v[p]);
return 0;
}