Cod sursa(job #2648353)
| Utilizator | Data | 10 septembrie 2020 12:55:25 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[105],v[105], answer[105];
int main()
{
f>>n;
for(int i=0; i<n; i++)
f>>a[i];
v[0]=1;
for(int i=1; i<=n; i++)
if(a[i]>a[i-1])
v[i]=v[i-1]+1;
else
v[i]=v[i-1];
g<<v[n-1]<<'\n';
int x=v[n-1];
int nr=0;
for(int i=n-1; i>=0; i--)
if(x==v[i])
{
answer[nr++]=a[i];
x--;
}
for(int i=nr-1; i>=0; i--)
g<<answer[i]<<" ";
return 0;
}
