Pagini recente » Cod sursa (job #663730) | Cod sursa (job #2445634) | Cod sursa (job #441393) | Cod sursa (job #1578512) | Cod sursa (job #2471137)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[1000000];
int main () {
int n;
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
int lmax = 0, l = 0, ok = 1;
int b, e;
int endmax, begmax;
for (int i = 1; i <= n; i++) {
//cout << v[i - 1] << ' ' << v[i] << ' ' << ok << endl;
if (v[i] >= v[i-1]) {
if (ok == 1) {
ok = 0;
l++;
b = i - 1;
}
else
l++;
//cout << l << endl;
}
if (v[i] < v[i-1] || i == n) {
ok = 1;
//cout << l << endl;
if (l > lmax) {
lmax = l;
endmax = i;
begmax = b;
}
l = 0;
}
}
fout << lmax << endl;
for (int i = begmax ; i <= endmax; i++)
if (v[i] != v[i - 1])
fout << v[i] << ' ';
}