Cod sursa(job #717646)
Utilizator | Vasilescu Ioan Cameleonul | Data | 20 martie 2012 09:10:14 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
unsigned i,n,v[100], min,k,c,sir[100],max=0,nr,ok=1;
f>>n>>min; v[1]=min;
for(i=1;i<=n;i++)
{
f>>v[i];
if(min>v[i]) min=v[i],c=i;
if(max<v[i]) max=v[i];
}
sir[1]=min;nr=1;
while(ok)
{
min=max;
for(i=c+1;i<=n;i++)
if(min>=v[i]) min=v[i], k=i;
c=k;
nr++;
sir[nr]=min;
if(c+1==n) ok=0;
}
g<<nr<<'\n';
for(i=1;i<=nr;i++)
g<<sir[i]<<' ';
f.close();
g.close();
}