题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5247
解题思路:这道题要求区间的连续性,可以用RMQ解决。首先可以确定的是如果区间的和必须是满足等差数列的求和,否则不会是连续的数。其次还要判断这个区间内的每一个数往左走遇到第一个与它相等的位置。如果该位置在区间内,说明区间内有重复的数。这里可以用RMQ维护。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
using namespace std;
const int maxn = 10005;
int n,m,num[maxn],pos[maxn],sum[maxn];
int L[maxn][20],dp[maxn][20];
map<int,int> Map;
void init()
{
for(int i = 1; i <= n; i++)
{
dp[i][0] = sum[i];
L[i][0] = pos[i];
}
for(int j = 1; (1 << j) <= n; j++)
for(int i = 1; i + (1 << j) - 1 <= n; i++)
{
dp[i][j] = min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
L[i][j] = max(L[i][j-1],L[i+(1<<(j-1))][j-1]);
}
}
int findMin(int l,int r)
{
int k = (int)(log(r - l + 1.0) / log(2.0));
return min(dp[l][k],dp[r-(1<<k)+1][k]);
}
int findLeft(int l,int r)
{
int k = (int)(log(r - l + 1.0) / log(2.0));
return max(L[l][k],L[r-(1<<k)+1][k]);
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
Map.clear();
for(int i = 1; i <= n; i++)
{
scanf("%d",&sum[i]);
pos[i] = Map[sum[i]];
Map[sum[i]] = i;
}
init();
for(int i = 1; i <= n; i++)
sum[i] += sum[i-1];
printf("Case #1:\n");
while(m--)
{
int k,ans = 0;
scanf("%d",&k);
for(int i = 1; i + k -1 <= n; i++)
{
int tmp = findMin(i,i+k-1);
if(sum[i+k-1] - sum[i-1] != (tmp + tmp + k - 1) * k / 2) continue;
if(findLeft(i,i+k-1) < i) ans++;
}
printf("%d\n",ans);
}
}
return 0;
}