Cod sursa(job #2560184)

Utilizator xXoctavianXxStanescu Matei Octavian xXoctavianXx Data 27 februarie 2020 20:11:15
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("and.in");
ofstream fout("and.out");

const int nmax=100002;

int n,maxim,cnt,nrmax;
int v[nmax];

int main()
{
    fin>>n;
    for(int i=0; i<n; ++i)
    {
        fin>>v[i];
        if(nrmax<v[i]) nrmax=v[i];
    }
    for(int p=0; p<32; p++)
    {
        for(int i=0; i<n; ++i)
        {
            if(v[i]&(1<<p))
            {
                cnt++;
            }
            else
            {
                maxim=max(cnt,maxim);
                cnt=0;
            }
        }
    }
    fout<<maxim;
    return 0;
}