HDU 4455 Substrings(预处理+dp)
题目大意：给你n个数字，然后m次查询，每次给你一个x，让你求出来1到x，2到x+1。。。不同数的和。
需要各种预处理，处理出来所有的间隔之间有多少相同的数字，处理出来最后一个被去掉的间隔有多少个不重复的数字。
dp[i] = dp[i-1]-S+T.S代表最后被略去的那个区间的不同的数，T代表新区间扩张之后每个区间增加的不同的数的和。
Substrings
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1983 Accepted Submission(s): 608
Problem Description
XXX has an array of length n. XXX wants to know that, for a given w, what is the sum of the distinct elements’ number in all substrings of length w. For example, the array is { 1 1 2 3 4 4 5 } When w = 3, there are five substrings of length 3. They are (1,1,2),(1,2,3),(2,3,4),(3,4,4),(4,4,5)
The distinct elements’ number of those five substrings are 2,3,3,2,2.
So the sum of the distinct elements’ number should be 2+3+3+2+2 = 12
The distinct elements’ number of those five substrings are 2,3,3,2,2.
So the sum of the distinct elements’ number should be 2+3+3+2+2 = 12
Input
There are several test cases.
Each test case starts with a positive integer n, the array length. The next line consists of n integers a 1,a 2…a n, representing the elements of the array.
Then there is a line with an integer Q, the number of queries. At last Q lines follow, each contains one integer w, the substring length of query. The input data ends with n = 0 For all cases, 06, 0<=Q<=10
4, 0<= a
1,a
2…a
n <=10
6
Each test case starts with a positive integer n, the array length. The next line consists of n integers a 1,a 2…a n, representing the elements of the array.
Then there is a line with an integer Q, the number of queries. At last Q lines follow, each contains one integer w, the substring length of query. The input data ends with n = 0 For all cases, 0
Output
For each test case, your program should output exactly Q lines, the sum of the distinct number in all substrings of length w for each query.
Sample Input
7 1 1 2 3 4 4 5 3 1 2 3 0
Sample Output
7 10 12
Source
2012 Asia Hangzhou Regional Contest
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include