Pagini recente » Cod sursa (job #2372287) | Cod sursa (job #2539744) | Cod sursa (job #283369) | Cod sursa (job #1630833) | Cod sursa (job #2299874)
#include<fstream>
using namespace std;
int v[100003] , l[100003] , n , i , k , maxim , t;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i = 1 ; i <= n ; i++)
f>>v[i];
l[n] = 1;
for(k = n - 1 ; k >= 1 ; k--)
{
maxim = 0;
for(i = k + 1 ; i <= n ; i++)
if(v[i] > v[k] && l[i] > maxim)
maxim = l[i];
l[k] = 1 + maxim;
}
maxim = l[1];
t = 1;
for(k = 1 ; k <= n ; k++)
if(l[k] > maxim)
{
maxim = l[k];
t = k;
}
g<<maxim<<"\n"<<v[t]<<" ";
for(i = t + 1 ; i <= n ; i++)
if(v[i] > v[t] && l[i] == maxim - 1)
{
g<<v[i]<<" ";
maxim--;
}
return 0;
}