Cod sursa(job #2383840)
Utilizator | Data | 19 martie 2019 20:29:26 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100001],a[100001],sol,rez,k;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>v[i-1])
a[++k]=v[i];
else
{
if(k>sol)
{
sol=k;
rez=i;
}
else
k=0;
}
}
g<<rez<<'\n';
for(int i=rez-sol;i<=rez;i++)
g<<a[i]<<' ';
return 0;
}