Cod sursa(job #1979866)
Utilizator | Data | 11 mai 2017 16:31:48 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define Nmax 100001
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[Nmax], s[Nmax], k;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
}
for(int i=1;i<=n;i++)
{
while(k>0 && s[k]>=v[i])
k--;
s[++k]=v[i];
}
g<<k<<'\n';
for(int i=1;i<=k;i++)
g<<s[i]<<" ";
return 0;
}