一次AC,我自己都觉得难以想象……
首先判断边界情况,若count都是0或者max都是0,则表示没有个数或者不存在数,故输出0;若countA和maxA都是0,表示不存在A,故输出countB和maxB的较小者;若countB和maxB都是0,表示不存在B,故输出countA和maxA的较小者;若非以上情况,则表示A和B都存在,此时理想情况下字符串最长是countA+countB。如果countA等于countB,则AB交替出现时字符串长度最大,输出countA+countB;否则,AB仍以交替形式出现,但count多者出现在首尾,假设countA小于countB,则对于现有字符串,A就全部都出现在字符串上了,有countA个,已达极限;而B则有countA+1个(尾部多一个),那么B最多能取countB和countA+1乘以maxB中的较小者(最大能取countA+1乘以maxB个的,当B的个数受countB限制,故只能取两者中的小者)。同理,countA大于countB的时候也同上分析。
Run Time: 0sec
Run Memory: 312KB
Code length: 772Bytes
Submit Time: 2011-12-22 01:04:44
// Problem#: 2503
// Submission#: 1108150
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
using namespace std;
int main()
{
int countA, countB;
int maxA, maxB;
cin >> countA >> countB >> maxA >> maxB;
if ( ( countA == 0 && countB == 0 ) || ( maxA == 0 && maxB == 0 ) )
cout << "0\n";
else if ( countA == 0 || maxA == 0 )
cout << min( countB, maxB ) << endl;
else if ( countB == 0 || maxB == 0 )
cout << min( countA, maxA ) << endl;
else {
if ( countA == countB )
cout << countA + countB << endl;
else if ( countA < countB )
cout << countA + min( countB, ( countA + 1 ) * maxB ) << endl;
else
cout << countB + min( countA, ( countB + 1 ) * maxA ) << endl;
}
return 0;
}