Pagini recente » Cod sursa (job #1973758) | Cod sursa (job #2884762) | Cod sursa (job #2908980) | Cod sursa (job #2621109) | Cod sursa (job #2312161)
#include <iostream>
#include <fstream>
#define N 100005
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[N],n;
int main()
{
int i,j,cand, vot;
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
fin.close();
/// ETAPA 1 - stabilim valoarea care are sanse sa fie majoritar
cand=a[1];
vot=1;
for(i=2; i<=n; ++i)
if(a[i]==cand)
++vot;
else if (vot>0)
vot--;
else
{
cand=a[i];
vot=1;
}
///ETAPA 2- verificam daca cand e element majoritar
vot=0;
for(i=1; i<=n; i++)
if(a[i]==cand)
++vot;
if(vot>n/2)
fout<<"DA "<<cand<<"\n";
else
fout<<"NU"<< "\n";
fout.close();
return 0;
}