Cod sursa(job #801242)
Utilizator | Data | 23 octombrie 2012 19:46:20 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,q,maxim=0;
long long a[100002],m[10000][10000];
int main()
{ f>>n;
for(i=1;i<=n;i++) f>>a[i];
i=1;
while(i<=n){ j=1;
m[i][j]=a[i];
for(q=i;q<=n;q++) if(a[q]>m[i][j]) {m[i][++j]=a[q]; ++m[i][0];}
i++;
}
for(i=1;i<=n;i++) if(maxim<m[i][0]) maxim=m[i][0];
g<<maxim<<'\n';
for(i=1;i<=maxim;i++) g<<m[maxim][i]<<" ";
g.close();
return 0;
}