Pagini recente » Cod sursa (job #1178523) | Cod sursa (job #414998) | Cod sursa (job #2596354) | Cod sursa (job #1910300) | Cod sursa (job #1502410)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int num[100000], length[100000], place[100000];
int main()
{
int n, maxx=0, p;
in >> n;
for(int i = 1; i <= n; i++)
in >> num[i];
length[n] = 1;
place[n] = -1;
for(int i = n - 1; i >= 1; i--)
{
length[i] = 1;
place[i] = -1;
for(int j = i + 1; j <= n; j++)
{
if(num[j] > num[i] && length[i] < length[j]+1)
{
length[i] = length[j] + 1;
place[i] = j;
if(length[i] > maxx)
{
p = i;
maxx = length[i];
}
}
}
}
for(int i = 1; i <= n; i++)
{
out << length[i] << " ";
}
out << "\n";
while(p != -1)
{
out << num[p] << " ";
p = place[p];
}
return 0;
}