Cod sursa(job #882535)
Utilizator | Data | 19 februarie 2013 10:35:47 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100],i,j,m,k;
int main ()
{f>>n;
f>>v[1];
m=v[1];
for (i=2;i<=n; i++)
{
f>>v[i];
if (m>v[i])
{m=v[i];k++;}
}
for (i=2;i<=n;i++)
{
f>>v[i];
if (v[i]>m)
{
m=v[i];k++;
}
}
g<<k<<"\n";
f>>v[1];
m=v[1];
for (i=2;i<=n; i++)
{
f>>v[i];
if (m>v[i])
{m=v[i];g<<m<<" ";}
}
for (i=2;i<=n;i++)
{
f>>v[i];
if (v[i]>m)
{
m=v[i];g<<m<<" ";
}
}
f.close ();
g.close ();
return 0;
}