hdu 5635 LCP Array(BC第一题)
来源:互联网 发布:淘宝网店服装头像图片 编辑:程序博客网 时间:2024/05/21 11:29
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5635
LCP Array
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 282 Accepted Submission(s): 79
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)
#include <iostream>#include <stdio.h>using namespace std;struct Arrow{ int a; int b;}arrow[50];//?int cmp(const void * a,const void *b){ Arrow m = *(Arrow*)a; Arrow n = *(Arrow*)b; return m.a-n.a;}int create(int i){i=i-2;printf(">+");while(i--){printf("-");}printf("+>\n");return 0;}int main(){int t,N,three,four;scanf("%d",&t);// 0 1 2 3while(t--){scanf("%d",&N);for(int Ni=0;Ni<N;Ni++){scanf("%d%d",&arrow[Ni].a,&arrow[Ni].b);}qsort(arrow,N,sizeof(arrow[0]),cmp);for(int Ni=0;Ni<N;Ni++){ for(int i=0;i<arrow[Ni].b;i++){ create(arrow[Ni].a); } printf("\n");}}return 0;}
0 0
- hdu 5635 LCP Array(BC第一题)
- hdu 5635 LCP Array(BC第一题)
- 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 5635】LCP Array 中文题意&题解&代码(C++)
- HDU problem 5635 LCP Array【思维】
- hdoj LCP Array 5635 (找规律)
- ♥HDOJ 5635-LCP Array
- hdoj 5635 LCP Array 【模拟】
- hdoj 5635 LCP Array (模拟)
- LCP Array
- BC#34-第一题
- BC#29第一题
- C# 汉字转拼音(支持GB2312字符集中所有汉字)
- ytu1402: 1.1.2 Greedy Gift Givers 贪婪的送礼者
- Hbase完全分布式配置
- springMVC 和 struts2区别
- iOS中根据已有经纬度定位并显示在地图上
- hdu 5635 LCP Array(BC第一题)
- ScrollView中ListView显示不全解决方法
- oracle中的exists 和not exists 用法详解
- 关于这两个月
- 字符串格式化代码整理
- codeforces Good Bye 2015 B
- 异或运算在算法编程题中的应用
- ytu 1403: 1.1.3 Friday the Thirteenth 黑色星期五
- ScrollView中ListView显示不全解决方法