P4302 [SCOI2003]字符串折叠（区间dp）

最新推荐文章于 2024-10-07 19:01:55 发布

eva_can(not)survive

最新推荐文章于 2024-10-07 19:01:55 发布

阅读量158

点赞数

分类专栏： DP 洛谷学习文章标签： c++

本文链接：https://blog.csdn.net/Ghostttttttiii/article/details/124592932

版权

动态规划字符串处理算法预处理最短长度

关键词由CSDN通过智能技术生成

洛谷学习同时被 2 个专栏收录

202 篇文章 0 订阅

订阅专栏

71 篇文章 0 订阅

订阅专栏

P4302 [SCOI2003]字符串折叠https://www.luogu.com.cn/problem/P4302

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


int pre[MAXN];
char s[MAXN];
int f[105][103];

bool judge(int l, int r, int len) {
	for (int i = l; i <= r; i++) {
		if (s[i] != s[(i - l) % len + l])
			return false;
	}
	return true;
}

int main() {
	memset(f, 0x3f, sizeof(f));
	scanf("%s", s + 1);
	int n = strlen(s + 1);
	//printf("%d %s\n", n, s + 1);
	for (int i = 1; i <= 9; i++) {
		pre[i] = 1;
	}
	for (int i = 10; i <= 99; i++) {
		pre[i] = 2;
	}
	pre[100] = 3;
	for (int i = 1; i <= n; i++) {
		f[i][i] = 1;
	}
	for (int l = 2; l <= n; l++) {
		for (int i = 1, j = i + l - 1; j <= n; i++, j++) {
			for (int k = i; k < j; k++) {
				f[i][j] = min(f[i][j], f[i][k] + f[k + 1][j]);
			}
			for (int k = i; k <= j; k++) {
				int len = k - i + 1;
				if (l % len != 0)
					continue;
				if (judge(i, j, len))
					f[i][j] = min(f[i][j], f[i][k] + 2 + pre[l / len]);
			}
		}
	}
	printf("%d", f[1][n]);
	return 0;
}