Pagini recente » Cod sursa (job #1492602) | Cod sursa (job #2277707) | Cod sursa (job #1492526) | Cod sursa (job #1492570) | Cod sursa (job #732422)
Cod sursa(job #732422)
#include <fstream>
using namespace std;
ifstream F("elmaj.in");
ofstream G("elmaj.out");
#define Nmax 1000011
int A[Nmax],N;
void read()
{
F>>N;
for (int i=1;i<=N;++i)
F>>A[i];
}
void solve()
{
int k=1,cand=A[N];
for (int i=1;i<N;++i)
{
k=( A[i]==cand )? k+1 : k-1;
if ( k==-1 ) k=1,cand=A[i];
}
if ( k<=0 )
{ G<<"-1\n"; return; }
k=( A[N]==cand )?1:0;
for (int i=1;i<N;++i)
k=( A[i]==cand )?k+1:k;
if ( k< N/2+1 )
{ G<<"-1\n"; return; }
G<<cand<<' '<<k<<'\n';
}
int main()
{
read();
solve();
return 0;
}