Pagini recente » Cod sursa (job #93014) | Cod sursa (job #1017907) | Cod sursa (job #1396688) | Cod sursa (job #1014310) | Cod sursa (job #1013158)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
long n,i,a[100000],j;
f>>n;
for(i=0;i<n;i++){
f>>a[i];
}
int nr=1;
int maxi=0;
int v[100000];
int endd=0;
for(i=0;i<n;i++){
for(j=i;j<n;j++){
if(a[j]>a[i]){
nr++;
}
}
if(nr>maxi){
maxi=nr;
endd=j;
}
//cout<<nr<<'\n';
nr=1;
}
//cout<<endd;
//g<<maxi;
j=0;
for(i=endd-maxi;i<endd;i++){
v[j]=a[i];
j++;
}
int lungime=j;
int aux=0;
for(i=0;i<lungime-1;i++)
for(j=i+1;j<lungime;j++){
if(v[i]>v[j]){
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
//cout<<v[i]<<" ";
int countt=1;
for(i=1;i<lungime;i++)
{
if(v[i]!=v[i-1]){
//cout<<v[i];
countt++;
}
}
g<<countt<<'\n';
g<<v[0]<<" ";
for(i=1;i<lungime;i++)
{
if(v[i]!=v[i-1]){
g<<v[i]<<" ";
//countt++;
}
}
return 0;
}