Cod sursa(job #1747567)
| Utilizator | Data | 25 august 2016 09:43:03 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#define Nmax 1000001
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a[Nmax];
int mooreMajority(int n, int a[])
{
int cand=-1,k=0;
for(int i=1;i<=n;i++)
if(k==0)
cand=a[i],k=1;
else
if(a[i]==cand)
k++;
else
k--;
if(cand<0)
return cand;
int nr=0;
for(int i=1;i<=n;i++)
if(cand==a[i])
nr++;
if(nr>=n/2+1)
g<<cand<<" "<<nr;
else
g<<-1;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
mooreMajority(n,a);
}
