大数运算+动态规划
大数加法还是得注意下最后一位进位的添加。。。
状态转移方程:
开个坑先。。。
潜在优化:
- 大数运算相关优化
- 开个坑先。。。
代码如下:
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int m;
string dp[51][51];
string num;
string add(string s1,string s2) {
string result = "";
string rs1(s1), rs2(s2);
rs1.assign(rs1.rbegin(), rs1.rend());
rs2.assign(rs2.rbegin(), rs2.rend());
int more = 0;
for (int i = 0; i < max(rs1.size(), rs2.size()); ++i) {
int n1 = (i < rs1.size()) ? rs1[i] - '0' : 0,
n2 = (i < rs2.size()) ? rs2[i] - '0' : 0;
result += (((n1 + n2 + more) % 10) + '0');
more = (n2 + n1 + more) / 10;
}
if (more > 0) result += (more + '0');
return result.assign(result.rbegin(), result.rend());
}
bool judge(string s1, string s2) {
if (s1 == "MAX") return true;
if (s1.size() > s2.size()) return true;
else if (s1.size() == s2.size() && s1 > s2) return true;
return false;
}
void findans() {
for (int i = 1; i <= num.size(); ++i) {
for (int j = 0; j < i; ++j) {
dp[i][j] = "MAX";
if (j == 0) dp[i][j] = num.substr(0, i);
else if (j > m) break;
else {
for (int k = 1; k < i; ++k) {
if (k < j) continue;
string temp = add(dp[k][j - 1], num.substr(k, i - k));
if (judge(dp[i][j], temp)) dp[i][j] = temp;
}
}
}
}
cout << dp[num.size()][m]<<endl;
}
int main(){
while (cin >> m >> num) findans();
return 0;
}