# hdu 5635 LCP Array【思维】

692 篇文章 0 订阅

## LCP Array

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 596    Accepted Submission(s): 161

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)(1i<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 modulo 109+7 .

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 integer n ( 2n105) -- the length of the string. The second line contains n1 integers: a1,a2,...,an1 (0ain) .

The sum of values of n in all test cases doesn't exceed 106 .

Output
For each test case output one integer denoting the answer. The answer must be printed modulo 109+7 .

Sample Input


3
3
0 0
4
3 2 1
3
1 2



Sample Output


16250
26
0



Source

AC代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define  ll long long int
const int mod = 1e9 + 7;
ll a[121212];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i=0;i<n-1;i++)
{
scanf("%I64d",&a[i]);
}
ll output=26;ll cur=0;
for(int i=n-2;i>=0;i--)
{
if(a[i]-cur==1)
{
cur=a[i];
}
else if(a[i]==0)
{
output=(output*25)%mod;
cur=0;
}
else
{
output=0;
break;
}
}
printf("%I64d\n",output);
}
}


• 0
点赞
• 0
收藏
觉得还不错? 一键收藏
• 0
评论
09-23
07-14 79
01-19 274
03-05 787
03-05 476
09-20
09-20
09-22
03-07 933
03-03

### “相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。