Pagini recente » Cod sursa (job #782252) | Diferente pentru implica-te/arhiva-educationala intre reviziile 26 si 27 | Cod sursa (job #436357) | Cod sursa (job #2885041) | Cod sursa (job #895377)
Cod sursa(job #895377)
#include<fstream>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
const int NMAX = 100009;
int a[NMAX], best[NMAX], n, pre[NMAX], maxim, poz;
int main()
{
// freopen("scmax.in", "rt", stdin); freopen("scmax.out", "wt", stdout);
// scanf("%d", &n);
f>>n;
for(int i = 1; i <= n; ++i) f>>a[i]; //scanf("%d", &a[i]);
best[n] = 1;
pre[n] = n + 1;
for(int i = n - 1; i >= 1; --i)
{
if(a[i] < a[i + 1])
{
best[i] = best[i + 1] + 1;
pre[i] = i + 1;
}
else
if(a[i] == a[i + 1])
if(a[i] < a[pre[i + 1]]) best[i] = 1 + best[pre[i + 1]], pre[i] = pre[i + 1];
if(maxim < best[i]) maxim = best[i], poz = i;
}
g<<maxim<<'\n';
//printf("%d\n", maxim);
for(int i = poz; i <= n; i = pre[i])
g<<a[i]<<' ';//printf("%d ", a[i]);
g<<'\n';
g.close();
return 0;
}