Cod sursa(job #2367786)
Utilizator | Data | 5 martie 2019 12:15:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,k,el,x,nr,a[1000001];
int main()
{
f>>n;
for(int i=1;i<=n;++i){
f>>a[i];
if(k==0){
k=1;
el=a[i];
}
else if(a[i]==el) k++;
else k--;
}
if(k>0) {
for(int i=1;i<=n;++i){
if(a[i]==el) nr++;
}
if(nr>=n/2+1) g<<el<<" "<<nr;
else g<<-1;
}
else g<<-1;
}