HDU problem 5635 LCP Array【思维】
来源:互联网 发布:java 抽象工厂类 编辑:程序博客网 时间:2024/06/02 05:26
LCP Array
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1532 Accepted Submission(s): 468
Problem Description
Peter has a string s=s1s2...sn , let suffi=sisi+1...sn be the suffix start with i -th character of s . Peter knows the lcp (longest common prefix) of each two adjacent suffixes which denotes as ai=lcp(suffi,suffi+1)(1≤i<n ).
Given the lcp array, Peter wants to know how many strings containing lowercase English letters only will satisfy the lcp array. The answer may be too large, just print it modulo109+7 .
Given the lcp array, Peter wants to know how many strings containing lowercase English letters only will satisfy the lcp array. The answer may be too large, just print it modulo
Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains an integern (2≤n≤105) -- the length of the string. The second line contains n−1 integers: a1,a2,...,an−1 (0≤ai≤n) .
The sum of values ofn in all test cases doesn't exceed 106 .
The first line contains an integer
The sum of values of
Output
For each test case output one integer denoting the answer. The answer must be printed modulo 109+7 .
Sample Input
330 043 2 131 2
Sample Output
16250260
Source
BestCoder Round #74 (div.2)
Recommend
题意: 给你一个含有N-1个元素的数组,数组对应一个长度为N的字符串,数组中的第i个数的含义为字符串中第i个开头的和第i+1个开头的字符串的子串的最大公共前缀的长度,现在让你推算数这个字符串有多少种情况。
先把数组处理下,对于i个长度为0的子串,它的颜色和他的后面的元素的字母不相同,标记下。如果长度不为0,它的首字母必定和下个字母相同,然后利用最大长度检查剩下的是否也相同,要是不相同,则这组数据出错了。
利用记录的字符串的信息扫一下,如果某个位置的字符和它的后面的相同,则他的情况和后面支付的一样,否则它有25种可能性。
#include <map>#include <set>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <iostream>#include <stack>#include <cmath>#include <string>#include <vector>#include <cstdlib>//#include <bits/stdc++.h>//#define LOACL#define space " "using namespace std;typedef long long LL;typedef __int64 Int;typedef pair<int, int> PAI;const int INF = 0x3f3f3f3f;const double ESP = 1e-5;const double PI = acos(-1.0);const int MOD = 1e9 + 7;const int MAXN = 1e5 + 10;int ar[MAXN], clor[MAXN];int main() { int T, N; scanf("%d", &T); while (T--) { memset(clor, 0, sizeof(clor)); scanf("%d", &N); for (int i = 0; i < N - 1; i++) scanf("%d", &ar[i]); clor[N - 1] = 1; int cnt = 2; bool flag = false; for (int i = N - 2; i >= 0; i--) { if (ar[i] != 0) { clor[i] = clor[i + 1]; for (int j = 1; j <= ar[i]; j++) { if (clor[i] != clor[i + j]) {flag = true; break;} } if (clor[i + ar[i] + 1] == clor[i]) {flag = true; break;} } else clor[i] = cnt++; if (flag) break; } Int ans = 26; // cout << "数据发生错误: " << flag <<endl; bool change = false; int temp = clor[N - 1]; //for (int i = 0; i < N; i++) printf("第i个字母应该是%d\n", clor[i]); for (int i = N - 2; i >= 0; i--) { if (clor[i] != temp) { ans *= 25; temp = clor[i]; ans %= MOD; } } if (flag) printf("%d\n", 0); else printf("%I64d\n", ans); } return 0;}
0 0
- HDU problem 5635 LCP Array【思维】
- hdu 5635 LCP Array【思维】
- hdu 5635 LCP Array
- HDU 5635 LCP array
- HDU 5635:LCP Array
- HDU 5635 LCP Array
- 【HDU 5635 LCP Array】
- HDU 5635 LCP Array(水~)
- hdu 4898 LCP+贪心思维
- hdu 5635 LCP Array(BC第一题)
- 【hdu 5635】LCP Array 中文题意&题解&代码(C++)
- hdu 5635 LCP Array(BC第一题)
- ♥HDOJ 5635-LCP Array
- hdoj 5635 LCP Array 【模拟】
- hdoj 5635 LCP Array (模拟)
- LCP Array
- hdoj LCP Array 5635 (找规律)
- HDU5635 LCP Array BestCoder
- ccc碰撞系统的一个小坑
- div 绝对定位覆盖
- Java 读书笔记 14.1-14.6 RTTI
- 内核模块的编译、加载与卸载
- android Comparator做排序
- HDU problem 5635 LCP Array【思维】
- linux 静态库与共享库
- LVS_NAT模式
- 【latin】mysql校对规则(COLLATION)详解
- TextView上下滚动实现通知效果
- 你真的了解一段Java程序的生命史吗?
- Unity中Button的颜色如何用脚本改变
- RabbitMQ 持久化
- 关闭Eclipse按空格和等号键自动补全内容