Pagini recente » Cod sursa (job #3272922) | Cod sursa (job #3227295) | Cod sursa (job #686270) | Cod sursa (job #2558261) | Cod sursa (job #1378782)
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100],m,maxi,k,aux,n,c[100];
int main()
{
f>>n;
m=1;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
if(v[i]<=v[i+1])
{
k++;
m=m*10+i;
c[k]=v[i];
if(k>maxi)maxi=k;
}
else if(v[i]>v[i+1]) k=0;
}
m=m%10;
c[maxi+1]=v[m+1];
for(int i=1;i<maxi+1;i++)
for(int j=i+1;j<=maxi+1;j++)
if(c[i]>c[j])
{
aux=c[i];
c[i]=c[j];
c[j]=aux;
}
for(int i=1;i<maxi+1;i++)
{
if(c[i-1]==c[i])
c[i]=c[i+1];
}
maxi--;
g<<maxi+1<<"\n";
for(int i=1;i<=maxi+1;i++)
g<<c[i]<<" ";
return 0;
}