题解 | #求最大连续bit数#

#include <iostream>
#include <bitset>
using namespace std;

int main(){
    int num;
    int maxm = 0;
    int result = 0;
    while(cin >> num){       
        bitset<32> b(num);
        for(int i = 0; i < b.size(); i++){
            if(b[i] == 1 && b[i] == b[i+1]){
                maxm++;    
            }
            else{
                maxm = 0;  
            }
            result = max(maxm,result);          
        }
    }
    cout << result+1;
}