Pagini recente » Cod sursa (job #770139) | Cod sursa (job #1105317) | Cod sursa (job #1168784) | Cod sursa (job #2765146) | Cod sursa (job #3030302)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, m, k, N, maxx;
int a[1025], b[1025], p[1025];
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
f >> a[i];
for (int i = n; i >= 1; i--)
{
b[i] = 1;
p[i] = -1;
for (int j = 1; j <= n; j++)
{
if(a[j] > a[i])
if (b[i] < b[j] + 1)
{
b[i] = b[j] + 1;
p[i] = j;
}
}
if (b[i] > m) m = b[i], maxx = i;
}
g << m << '\n';
while (maxx != -1)
{
g << b[maxx] << ' ';
maxx = p[maxx];
}
return 0;
}