HDU 3746 Cyclic Nacklace (kmp求周期)
来源:互联网 发布:知乎 荣耀手机 编辑:程序博客网 时间:2024/05/10 02:50
题意:
求串添加几个字母,变成循环大于1次的串
分析:
求出周期=n−nxt[n],然后判断判断就可以搞了
代码:
//// Created by TaoSama on 2015-10-28// Copyright (c) 2015 TaoSama. All rights reserved.////#pragma comment(linker, "/STACK:1024000000,1024000000")#include <algorithm>#include <cctype>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <string>#include <set>#include <vector>using namespace std;#define pr(x) cout << #x << " = " << x << " "#define prln(x) cout << #x << " = " << x << endlconst int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;int n, nxt[N];char s[N];void getNxt() { nxt[0] = -1; int i = 0, j = -1; while(i < n) { if(j == -1 || s[i] == s[j]) nxt[++i] = ++j; else j = nxt[j]; }}int main() {#ifdef LOCAL freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);#endif ios_base::sync_with_stdio(0); int t; scanf("%d", &t); while(t--) { scanf("%s", s); n = strlen(s); getNxt(); int cycle = n - nxt[n]; int ans = n % cycle ? cycle - n % cycle : n / cycle > 1 ? 0 : cycle; printf("%d\n", ans); } return 0;}
0 0
- [HDU 3746]Cyclic Nacklace[kmp求周期]
- HDU 3746 Cyclic Nacklace (kmp求周期)
- HDU - 3746 Cyclic Nacklace (KMP求循环节)
- HDU 3746 Cyclic Nacklace (KMP求循环结)
- hdu 3746 Cyclic Nacklace (kmp求最小循环节)
- HDU 3746 Cyclic Nacklace (kmp求循环节)
- HDU-3746 Cyclic Nacklace(KMP求循环)
- HDU 3746 Cyclic Nacklace kmp处理字符串周期问题
- HDU 3746 Cyclic Nacklace 数据结构+kmp周期类问题
- hdu 3746 Cyclic Nacklace(KMP)
- hdu 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace(KMP)
- hdu 3746 Cyclic Nacklace(kmp)
- HDU 3746 Cyclic Nacklace(kmp)
- hdu 3746 Cyclic Nacklace (kmp)
- hdu 3746 Cyclic Nacklace(kmp)
- Socket编程实践(6) --TCP服务端注意事项
- app 审核指南
- Nginx之——413 修改上传文件大小限制
- 第五章:最后一步准备,1.8的Json模型、状态描述机制详解
- 一台主机利用apache服务器开启虚拟主机后无法使用www域名解决方法
- HDU 3746 Cyclic Nacklace (kmp求周期)
- 七周七种前端框架:前言
- 黑马程序员-Java高新技术
- 说说尾递归
- 垃圾回收机制的工作原理
- McAfee
- android6.0不支持Httpclient的解决方法
- UFT的学习经验
- 认识smack中的基本对象 - Registration