Pagini recente » Cod sursa (job #1811138) | Cod sursa (job #218081) | Cod sursa (job #2296782) | Cod sursa (job #3185027) | Cod sursa (job #2520095)
#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, k, maxim, v[100001], sir[100001], a[100001], nr;
void citire()
{
fin >> n;
for(int i=1; i<=n; i++)
{
fin >> v[i];
}
}
int main()
{
citire();
for (int i=1; i<=n; i++)
{
k = 1;
sir[1] = v[i];
nr = i;
for (int j=i+1; j<=n; j++)
{
if(v[nr] < v[j])
sir[++k] = v[j], nr = j;
}
if(k > maxim)
{
maxim = k;
for(int j=1; j<=k; j++)
a[j] = sir[j];
}
}
fout << maxim << '\n';
for (int i=1; i<=maxim; i++)
fout << a[i] << ' ';
}