Pagini recente » Cod sursa (job #1350937) | Cod sursa (job #1458933) | Cod sursa (job #2096756) | Cod sursa (job #818870) | Cod sursa (job #2893035)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
int v[100001], N, lgmax, lg, first, last;
int main() {
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
fin >> N;
for (int i = 1; i <= N; ++i) {
fin >> v[i];
}
for (int i = 1; i <= N; ++i) {
int j = i, lg = 1;
while (v[j] <= v[j + 1]) {
++lg;
++j;
}
if (lg > lgmax) {
first = i;
last = j;
lgmax = lg;
}
}
for (int i = first; i <= last; ++i) {
if (v[i] == v[i - 1]) {
--lgmax;
}
}
fout << lgmax << '\n';
int i = first;
while (i <= last) {
if (v[i] == v[i - 1]) {
++i;
} else {
fout << v[i] << ' ';
++i;
}
}
return 0;
}