Cod sursa(job #3335683)
| Utilizator | Data | 23 ianuarie 2026 10:54:55 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.81 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
long long v[100000],vs[100000];
int main()
{
int n,s=0,po;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n;i++)
{
int secv=1;
for(int ii=i+1;ii<=n;ii++)
{
if(v[ii]>v[ii-1])
{
secv++;
}
if(v[ii]<v[ii-1])
{
ii=n+1;
}
}
if(secv>s)
{
po=i;
s=secv;
}
}
int i=po;
fout<<s<<endl;
while(s>0)
{
if(v[i]!=v[i-1])
{
fout<<v[i]<<" ";
s--;
}
i++;
}
return 0;
}
