Pagini recente » Cod sursa (job #2132346) | Cod sursa (job #2612235) | Cod sursa (job #2481872) | Cod sursa (job #2714264) | Cod sursa (job #1788159)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMax = 100005;
int N;
int X[NMax],DP[NMax],Succ[NMax];
void Read()
{
fin>>N;
for(int i = 1; i <= N; ++i)
fin>>X[i];
}
void Solve()
{
for(int i = N; i >= 1; --i)
{
int Max = 0;
for(int j = i+1; j <= N; ++j)
{
if(X[i] < X[j] && DP[j] > Max)
{
Max = DP[j];
Succ[i] = j;
}
}
DP[i] = Max + 1;
}
}
void Print()
{
int Max = 0,P;
for(int i = 1; i <= N; ++i)
{
if(DP[i] > Max)
{
Max = DP[i];
P = i;
}
}
fout<<Max<<"\n";
while(P)
{
fout<<X[P]<<" ";
P = Succ[P];
}
fout<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}