You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
/**
|
|
|
|
|
* File: max_product_cutting.cpp
|
|
|
|
|
* Created Time: 2023-07-21
|
|
|
|
|
* Author: Krahets (krahets@163.com)
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "../utils/common.hpp"
|
|
|
|
|
|
|
|
|
|
/* 最大切分乘积:贪心 */
|
|
|
|
|
int maxProductCutting(int n) {
|
|
|
|
|
// 当 n <= 3 时,必须切分出一个 1
|
|
|
|
|
if (n <= 3) {
|
|
|
|
|
return 1 * (n - 1);
|
|
|
|
|
}
|
|
|
|
|
// 贪心地切分出 3 ,a 为 3 的个数,b 为余数
|
|
|
|
|
int a = n / 3;
|
|
|
|
|
int b = n % 3;
|
|
|
|
|
if (b == 1) {
|
|
|
|
|
// 当余数为 1 时,将一对 1 * 3 转化为 2 * 2
|
|
|
|
|
return (int)pow(3, a - 1) * 2 * 2;
|
|
|
|
|
}
|
|
|
|
|
if (b == 2) {
|
|
|
|
|
// 当余数为 2 时,不做处理
|
|
|
|
|
return (int)pow(3, a) * 2;
|
|
|
|
|
}
|
|
|
|
|
// 当余数为 0 时,不做处理
|
|
|
|
|
return (int)pow(3, a);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Driver Code */
|
|
|
|
|
int main() {
|
|
|
|
|
int n = 58;
|
|
|
|
|
|
|
|
|
|
// 贪心算法
|
|
|
|
|
int res = maxProductCutting(n);
|
|
|
|
|
cout << "最大切分乘积为" << res << endl;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|