Pagini recente » Cod sursa (job #1766677) | Cod sursa (job #2134411) | Cod sursa (job #2789671) | Cod sursa (job #1224668) | Cod sursa (job #214798)
Cod sursa(job #214798)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100000],v1[100000];
int main()
{
int n;
int i;
f>>n;
//citesc vertoru`!
for (i=1;i<=n;i++)
f>>v[i];
int j;
int nr,x;
//initializarea vectorului v1[]
for (i=1;i<n;i++)
{
nr=0;
x=v[i];
for (j=i+1;j<=n;j++)
if (v[i]<=v[j])
{
++nr;
}
v1[i]=nr;
}
//det pozitia pe care se afla maximu` in v1[];
int max;
max=v1[1];
int p=1;
for (i=1;i<=n;i++)
if (max<v1[i])
{
max=v1[i];
p=i;
}
max=max+1;
g<<max;
g<<endl;
x=v[p];
//aici afisez siru`
while (max!=0)
{g<<x<<" ";
max--;
while (x==v[p])
{
p++;
}
x=v[p];
}
return 0;
}