Cod sursa(job #2373042)
| Utilizator | Data | 7 martie 2019 11:57:07 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100001],poz[100001],lung=1;
void citire()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
}
int main()
{
citire();
poz[n]=n;
for(int i=n-1;i>=1;--i)
if(v[i]<v[i+1]) poz[i]=i-1;
else poz[i]=i;
for(int i=1;i<=n;++i)
if(poz[i]!=i) ++lung;
for(int i=1;i<n;++i)
if(poz[i]!=i) cout<<v[i]<<" ";
cout<<v[n];
return 0;
}
