Cod sursa(job #2489741)
Utilizator | Data | 9 noiembrie 2019 11:37:54 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.5 kb |
#include <iostream>
using namespace std;
unsigned int n,ap,v[100001],i,m;
int main()
{
cin>>n>>v[1];
m=v[1];ap=1;
for(i=2;i<=n;i++)
{
cin>>v[i];
if(ap==0)
{
m=v[i];
ap=1;
}
else if(v[i]==m)
ap++;
else ap--;
}
ap=0;
for(i=1;i<=n;i++)
{
if(v[i]==m)
ap++;
if(ap>n/2)
{
cout<<"DA "<<m;
return 0;
}
}
cout<<"NU";
}