Cod sursa(job #2557472)
| Utilizator | Data | 25 februarie 2020 20:23:52 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[666];
ifstream f("scmax.in");
ofstream g("scmax.out");
void rezolvare(int n,int v[])
{
int i,j,q[666],m=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(v[i]<q[j])
{
q[j]=v[i];
break;
}
if(v[i]>q[m])
{
m=m+1;
q[m]=v[i];
break;
}
}
}
g<<m<<'\n';
for(j=1;j<=m;j++)
g<<q[j]<<" ";
}
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
rezolvare(n,v);
return 0;
}
