Pagini recente » Cod sursa (job #2390247) | Cod sursa (job #2964956) | Cod sursa (job #2949141) | Cod sursa (job #1824435) | Cod sursa (job #1984412)
#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],Sol;
void Read()
{
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> X[i];
}
void Solve()
{
for(int i = N; i > 0; --i)
{
int Max = 0;
for(int j = i + 1; j <= N; ++j)
if(X[i] < X[j] && DP[j] > Max)
{
Succ[i] = j;
Max = DP[j];
}
DP[i] = 1 + Max;
}
}
void Path(int i)
{
while(i)
{
fout << X[i] << " ";
i = Succ[i];
}
fout << "\n";
}
void Print()
{
int Start;
for(int i = 1; i <= N; ++i)
{
if(DP[i] > Sol)
{
Sol = DP[i];
Start = i;
}
}
fout << Sol << "\n";
Path(Start);
}
int main()
{
Read();
Solve();
Print();
return 0;
}