从长为n的全为正数的数组a中,找到个数最少的连续子数列使其和>=m
example:
n=10,m=15,a[10]={5 1 3 5 10 7 4 9 2 8},结果为2
algorithm:
维护一个队列,这个队列中的数正好满足要求,队列头从数组起始位置往右移动,遍历一遍后,输出队列出现过的个数最少时的队列元素个数
int cal(int * a,int n,int m)
{
int* aSum=new int[n];
int s=0;
for(int i=0;i<n;i++)
{
s=s+a[i];
aSum[i]=s;
}
if(aSum[n-1]<m)
return 0;
if(aSum[n-1]==m)
return n;
int low=0,high=1;
if(a[0]>=m)
return 1;
int result=n;
while(aSum[high]<m)
high++;
result=high+1;
for(low=1;low<n-1;low++)
{
if(aSum[high]-aSum[low-1]>=m)
{
while(aSum[high]-aSum[low-1]>=m)
{
high--;
}
high++;
if(high-low+1<result)
result=high-low+1;
continue;
}
if(aSum[high]-aSum[low-1]<m)
{
while(aSum[high]-aSum[low-1]<m)
{
high++;
if(high>=n-1)
return result;
}
if(high-low+1<result)
result=high-low+1;
}
}
return result;
}