给定长度为n的整数数列：a0,a1,..,an-1，以及整数S。这个数列会有连续的子序列的整数总和大于S的，求这些数列中，最小的长度。

#include <iostream>
using namespace std;

int min_seri_len(int *a, int n, int S){
int i = 0;
int j = 0;
int min_len = 0;

int * sum = new int[n+1];
sum[0] = 0;
for(i =1; i < n+1; i++){
sum[i] = sum[i -1] + a[i-1];
}

i = 0;
j = 0;
min_len = n;

while(i < n+1 & j< n+1){
while((sum[j] - sum[i])<= S)
{
j++;
}

while((i < j) && ((sum[j]- sum[i]) > S)){
i++;
}

if ((i == j) && (sum[j] > S))
return 1;
if (min_len > (j - i +1))
min_len = j - i +1;

}

delete [] sum;

return min_len;
}

int main()
{
int a[10] = {5,1,3,5,10,7,4,9,2,8};
int S = 10;
int min_len = 0;
min_len = min_seri_len(a, 10 ,S);
cout<<min_len<<endl;
system("pause()");
return 0;
}