Pagini recente » Cod sursa (job #181646) | Cod sursa (job #1274750) | Cod sursa (job #2944990) | Cod sursa (job #543648) | Cod sursa (job #2956925)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX = 1e5+5;
int n, arr[NMAX], dp[NMAX];
inline void solve()
{
int k = 1;
dp[1] = arr[1];
for(int i = 2; i <= n; ++ i)
{
if(arr[i] > dp[k])
{
dp[++k] = arr[i];
}
else
{
int st = 1, dr = k, poz = k + 1;
while(st <= dr)
{
int mid = (st + dr) / 2;
if(dp[mid] > arr[i])
dr = mid - 1, poz = mid;
else
st = mid + 1;
}
dp[poz] = arr[i];
}
}
fout << k << '\n';
for(int i = 1; i <= k; ++ i)
fout << dp[i] << ' ';
}
int main()
{
fin >> n;
for(int i = 1; i <= n; ++ i)
fin >> arr[i];
solve();
}