CodeForces 626C 二分_maximum value codeforces

本文链接：https://blog.csdn.net/black_miracle/article/details/51236077

Block Towers

time limit： per test

2 seconds

memory limit： per test

256 megabytes

input：

standard input

output：

standard output

Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.

The students don’t want to use too many blocks, but they also want to be unique, so no two students’ towers may contain the same number of blocks. Find the minimum height necessary for the tallest of the students' towers.

Input

The first line of the input contains two space-separated integers n and m (0 ≤ n, m ≤ 1 000 000, n + m > 0) — the number of students using two-block pieces and the number of students using three-block pieces, respectively.

Output

Print a single integer, denoting the minimum possible height of the tallest tower.

   Examples 
 
     input 
   
 1 3 
   
     output 
   
 9 
   
     input 
   
 3 2 
   
     output 
   
 8 
   
     input 
   
 5 0 
   
     output 
   
 10

Note

In the first case, the student using two-block pieces can make a tower of height 4, and the students using three-block pieces can make towers of height 3, 6, and 9 blocks. The tallest tower has a height of 9 blocks.

In the second case, the students can make towers of heights 2, 4, and 8 with two-block pieces and towers of heights 3 and 6 with three-block pieces, for a maximum height of 8 blocks.

题目意思是有n个只能用高度为2的砖块的孩子，有m个只能用高度为3的砖块的孩子，他们会为自己造高度为h的塔，但是每个孩子的塔高不能一样，现在给你n和m，问你最小高度是多少。

解题思路：数字i前面（包括i）是2或者3的倍数的数的个数有i/2+i/3-i/6个，最小塔高为max（2*n,3*m），最大塔高为3000000（因为3000000中2或3倍数有1500000+1000000-500000=2000000），所以只要在这两个数之间找出最小的符合条件的塔高即可。

条件：
1.h/2+h/3-h/6>=n+m 要保证前h个数一定有n+m个是2或者3的倍数的数
2.h/2>=n 要保证前h个数有n个2的倍数
3.h/3>=m 要保证前h个数有m个3的倍数

2000000也不算大，可以直接暴力，但是如果给你2000000000就要GG了，最好用二分法。

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int l=max(2*n,3*m),r=3000005;
    while(l<r)	
    {
         int y=(l+r)/2;
        if(y/2+y/3-y/6>=n+m&&y/2>=n&&y/3>=m)r=y;
        else l=y+1;
    }
    printf("%d\n",l);
    return 0;
}