Cod sursa(job #1800193)
Utilizator | Data | 7 noiembrie 2016 15:20:10 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,j,n,a[10010],l[10010],Max;
int main()
{
f>>n;
Max=1;
for(i=0; i<n; i++)
{
f>>a[i];
j=1;
while(a[j] < a[i] && j <= Max)
j++;
a[j] = a[i];
if(j > Max)
Max=j;
}
g<<Max;
g<<endl;
for(i=1; i<=Max; i++)
g<<a[i]<<" ";
return 0;
}