Cod sursa(job #2388633)
Utilizator | Data | 26 martie 2019 11:43:43 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
//#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
deque <int> y;
vector <int> x;
long long n,i,j,db;
int main()
{
cin>>n;
x.resize(n+1);
for (i=1;i<=n;++i)
{
cin>>x[i];
if (x[i-1]<x[i])
{
db++;
if (db==1) y.push_back(x[i-1]);
y.push_back(x[i]);
}
if (x[i-1]>x[i])
{
db=0;
y.clear();
}
}
cout<<db<<"\n";
for (auto e:y) cout<<e<<" ";
return 0;
}