Cod sursa(job #1565870)
Utilizator | Data | 11 ianuarie 2016 16:19:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long x,a[1000000];
int n,i,nr,sol,Max=0,m=0;
int main()
{
in>>n;
for(i=1;i<=n;i++)
in>>a[i];
nr=1; x=a[1];
for(i=2; i<=n; i++)
{
if (a[i] == x) nr++;
else
{
x=a[i]; nr=1;
}
if (nr >= Max)
{
Max = nr;
sol = x;
}
}
for(i=1;i<=n;i++)
if(a[i]==sol) m++;
out<<sol<<' '<<m;
return 0;
}