Pagini recente » Cod sursa (job #2949498) | Cod sursa (job #432436) | Cod sursa (job #884138) | Cod sursa (job #2786466) | Cod sursa (job #1607390)
#include <fstream>
long int v[1000000];
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,k,j,elmaj=-1,ap=0;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
for(i=0;i<=n/2+1;i++)
{
if(v[i]==v[i-1])
i++;
if(v[i]!=v[0])
{
k=n/2+1;
ap=1;
}
else
{
k=n/2+2;
ap=1;
}
for(j=i+1;j<n;j++)
{
if(v[i]!=v[j]&&k>0)
{
k--;
}
else if(k==0)
break;
else
{
k++;
ap++;
}
}
if(k>n/2+1)
{
elmaj=v[i];
break;
}
}
if(elmaj>0)
g<<elmaj<<" "<<ap;
else
g<<"-1";
}