Sicily 2503最长字符串

先判断哪个多决定把哪个放前面，再相间放入，如ABABABAB，然后再插入就好，注意A或B个数为0时的情况

#include <iostream>

using namespace std;

int main()
{
    int num_a,num_b,a,b;
    while(cin >> num_a >> num_b >> a >> b){
        int count=0;
        if(a!=0&&b!=0){
        if(num_a >= num_b){
            count=num_b*2;
            num_a-=num_b;
            if(num_a>=1){
                num_b++;
                num_a--;
                count++;
            }
            if(num_a > (a-1)*num_b) count+=num_b*(a-1);
            else count+=num_a;
        }
        else{
            count=num_a*2;
            num_b-=num_a;
            if(num_b >= 1){
                num_a++;
                num_b--;
                count++;
            }
            if(num_b > (b-1)*num_a) count += num_a*(b-1);
            else count += num_b;
        }
        }
        else{
            if(a==0&&b==0) count=0;
            else if(a==0&&b!=0) count=b;
            else if(a!=0&&b==0) count=a;
        }
        cout << count << endl;
    }
}