Submission #996339

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
string dp[2100][2100];
int n; string S;
int main() {
	cin >> n; n++; string S; cin >> S;
	int P = S.size() / n; int Q = S.size() - P*n, R = n - Q;
	for (int i = 0; i < 2000; i++) { for (int j = 0; j <= R; j++) { for (int k = 0; k <= P + 1; k++)dp[i][j] += "9"; } }
	dp[0][0] = "";
	for (int i = 0; i < S.size(); i++) {
		for (int j = 0; j <= R; j++) {
			if (i + P <= S.size())dp[i + P][j + 1] = min(dp[i + P][j + 1], max(dp[i][j], S.substr(i, P)));
			if (i + P + 1 <= S.size())dp[i + P + 1][j] = min(dp[i + P + 1][j], max(dp[i][j], S.substr(i, P + 1)));
		}
	}
	cout << dp[S.size()][R] << endl;
	return 0;
}

Submission Info

Judge Result