Cod sursa(job #1212224)
Utilizator | Data | 24 iulie 2014 10:30:42 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,a[100],o,i,p,j,k[100];
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
for(i=1;i<=n;++i)
fin>>a[i];
o=2;
for(i=1;i<n;++i)
{
for(j=o;j<=n;++j)
if(a[i]>=a[j])
a[i]=0;
o++;
}
for(i=1;i<=n;++i)
if(a[i]>0)
fout<<a[i]<<" ";
return 0;
}