http://codeforces.com/problemset/problem/484/A
给出一个区间[l,r],求出一个数x ( l <= x <= r ),其二进制中含有的1的个数最多,若有多个满足条件,输出最小的。
贪心的思想。对l,r的二进制从高到低模拟,对于两数对应位置上都是1或0的,结果的相应位也取该值,否则一定是r[i] = 1并且l[i] = 0,因为r >= l,那么结果的该位取0,之后的低位都低位,保证1的个数是最多的。
#include <stdio.h>
#include <iostream>
#include <map>
#include <set>
#include <bitset>
#include <list>
#include <stack>
#include <vector>
#include <math.h>
#include <string.h>
#include <queue>
#include <string>
#include <stdlib.h>
#include <algorithm>
#define LL __int64
//#define LL long long
#define ULL unsigned long long
#define eps 1e-9
#define PI acos(-1.0)
using namespace std;
const LL maxn = 10^18;
int bit1[100],bit2[100];
int bit3[100];
int len1,len2,len3;
LL ans;
int main()
{
LL l,r;
LL ll,rr;
int test;
scanf("%d",&test);
while(test--)
{
scanf("%I64d %I64d",&l,&r);
len1 = len2 = len3 = 0;
ans = 0;
memset(bit1,0,sizeof(bit1));
memset(bit2,0,sizeof(bit2));
ll = l;
rr = r;
while(ll)
{
bit1[len1++] = ll%2;
ll /= 2;
}
while(rr)
{
bit2[len2++] = rr%2;
rr /= 2;
}
int i;
for(i = len2-1; i >= 0; i--)
{
if(bit1[i]+bit2[i] == 0 || bit1[i]+bit2[i] == 2)
bit3[i] = bit1[i];
else break;
}
int flag = 1;
for(int j = i; j >= 0; j--)
{
if(bit2[j] == 0)
{
flag = 0;
break;
}
}
if(flag == 1)
{
for(int j = i; j >= 0; j--)
bit3[j] = 1;
}
else
{
bit3[i] = 0;
for(int j = i-1; j >= 0; j--)
bit3[j] = 1;
}
for(int i = 0; i < len2; i++)
ans += (LL)pow(2,i)*bit3[i];
printf("%I64d\n",ans);
}
return 0;
}