Cod sursa(job #2526082)
| Utilizator | Data | 18 ianuarie 2020 11:38:26 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
int n;
f >> n;
int v[n],x[n],x1[n]={0};x[n-1]=1;
for (int i=0;i<=n-1;i++){
f >> v[i];
}for (int i=n-2;i>=0;i--){
if(v[i]<v[i+1]){
x[i]=x[i+1]+1;
x1[i]=v[i];
}else if (x[i-1]==1)
x1[n-1]=v[i];
else
x[i]=x[i+1];
}g << x[0] << '\n';
if (x[n-2]==2)
x1[n-1]=v[n-1];
for (int i=0;i<=n-1;i++){
if (x1[i]!=0)
g << x1[i] << ' ';
}
g.close();
return 0;
}
