Cod sursa(job #1119018)
| Utilizator | Data | 24 februarie 2014 14:33:36 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,j,n,x,v[100005],l;
int main()
{
f>>n;
for (i=1;i<=n;++i)
{
f>>x;
for (j=1;j<=l;++j)
if (v[j]>=x)
{
v[j]=x;
break;
}
if (j==l+1)
{
v[++l]=x;
}
}
g<<l<<'\n';
for (i=1;i<=l;++i)
g<<v[i]<<" ";
return 0;
}
