传送门: CF-C. Block Towers
#include<iostream>
using namespace std;
int n,m;
bool check(int x)
{
int num1=x/2;
int num2=x/3;
int num3=x/6;
if(num1<n) return false;
if(num2<m) return false;
if(min(num3,num1-n)<m-(num2-num3)) return false;
//本题关键:利用贪心的思想,把2和3公倍数,尽可能的都给3,这样可能确保满足条件的值最小
return true;
}
int main()
{
scanf("%d%d",&n,&m);
int l=0,r=1e7,ans=0;
while(l<=r){
int mid=(l+r)/2;
if(check(mid)) ans=mid,r=mid-1;
else l=mid+1;
}
printf("%d\n",ans);
return 0;
}
2018/6/6再次回头看这题,发现check()里的并不好理解,所以有重写了一个
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int n,m;
bool C(int x){
int num1=x/2,num2=x/3,num3=x/6;
return num1>=n&&num2>=m&&(num1+num2-num3)>=n+m;
}
void solve(){
int lb=0,ub=1e7;
while(ub-lb>1){
int mid=(lb+ub)/2;
if(C(mid)) ub=mid;
else lb=mid;
}
printf("%d\n",ub);
}
int main()
{
scanf("%d%d",&n,&m);
solve();
return 0;
}