Pagini recente » Cod sursa (job #2753830) | Cod sursa (job #1104275) | Cod sursa (job #2630242) | Cod sursa (job #2131599) | Cod sursa (job #2229275)
#include <bits/stdc++.h>
using namespace std;
int Max, N, i, in, sf, k, K, sc, IN;
long long v[100005];
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
scanf("%d", &N);
for(i = 1; i <= N; i++) scanf("%lld", &v[i]);
in = 1;
IN = 1;
for(i = 1; i <= N; i++) {
if(v[i] > v[i - 1])
k++;
else if(v[i] < v[i - 1]) {
if(k > Max) {
Max = k;
sf = i - 1;
IN = in;
}
k = 1;
in = i;
}
}
if(k > Max) {
Max = k;
sf = N;
IN = in;
}
printf("%d\n", Max);
v[IN - 1] = 0;
for(i = IN; i <= sf; i++) if(v[i] > v[i - 1]) printf("%lld ", v[i]);
return 0;
}