Pagini recente » Cod sursa (job #2276945) | Cod sursa (job #3150557) | Statistici lemist95 (lemist_95) | Cod sursa (job #2415945) | Cod sursa (job #2073056)
#include <iostream>
#include <vector>
#include <fstream>
#define uint unsigned int
std::ifstream f("elmaj.in");
std::ofstream out("elmaj.out");
int main()
{
size_t size;
f >> size;
std::vector<uint> numbers(size);
while (f.good())
{
uint n;
f >> n;
numbers.push_back(n);
}
f.close();
int number = -1;
uint max = 0;
int ct = 0;
for (const auto n : numbers)
{
if (number == -1)
{
number = n;
continue;
}
if (number != n) ct--; else ct++;
if (ct > max) max = ct;
if (ct == -1)
{
number = -1;
ct = 0;
}
}
// if (number != -1)
// std::cout << "Most occuring number: " << number << " Number of occurences: " << max + 1;
// else
// std::cout << "There is no such number";
if (number == -1)
{
out << -1;
}
else
{
out << number;
out << max;
}
}