Cod sursa(job #1169037)
Utilizator | Data | 10 aprilie 2014 11:54:57 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long a[1000001];
int i,n,ult,con;
int main()
{
f>>n;
f>>a[1];
ult=a[1];
con=1;
for(i=2;i<=n;i++)
{
f>>a[i];
if(a[i]==ult)
con++;
else
con--;
if(con==-1)
{
ult=a[i];
con=1;
}
}
g<<ult<<" ";
con=0;
for(i=1;i<=n;i++)
{
if(a[i]==ult)
con++;
}
g<<con;
return 0;
}