Pagini recente » Cod sursa (job #1069366) | Cod sursa (job #1125821) | Cod sursa (job #3139331) | Cod sursa (job #2312902) | Cod sursa (job #1167618)
#include <fstream>
#include <unordered_map>
int a[1000001];
int main()
{
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int n,x;
int max=0, xmax=0;
fin>>n;
std::unordered_map<int, int> m(n*3);
fin>>x;
max=1;
xmax=x;
m[x]=1;
for(int i=1;i<n;i++)
{
fin>>x;
if(m.find(x)==m.end())
{
m[x]=1;
}
else
{
int t = m[x];
if(max<t+1)
{
max = t+1;
xmax=x;
}
m[x]=t+1;
}
}
fout<<xmax<<" "<<max;
return 0;
}