复杂度2 Maximum Subsequence Sum (25 分)

用了好多测试用例都没明白为什么第六个测试点过不去。。。如果知道这个请告诉我一声

#include<stdio.h>

int sub(int array[],long int len,long int pos[]);

int sub(int array[],long int len,long int pos[])
{
	long int i, j, length = 0;
	int this = 0, max = -1, flag, temp;

	for(i = 0; i < len; i++)
	{
		flag = 1;
		this += array[i];
		if(this >= max && this != -1)
		{
			if(this == max)
			{
				flag = 0;
			}

			max = this;
		}
		else if(this < 0)
		{
			this = 0;
			flag = 0;
		}

		if(this == max && flag && (max != -1))
		{
			pos[1] = i;
		}

	}

	for(j = pos[1], temp = max; array[j] != temp && j > 0; j-- )
	{
		temp -= array[j];
	}
	while(j > 0)
	{
		if(!array[j-1])
		{
			j--;
		}
		else
		{
			break;
		}
	}
	pos[0] = j;

	return max > 0? max : 0;
}

int main()
{
	long int k, i, pos[2];
	scanf("%ld",&k);
	int array[10001];

	//初始化
	pos[0] = 0;
	pos[1] = k - 1;

	for(i = 0; i < k; i++)
	{
		scanf("%d",&array[i]);
	}

	printf("%d ",sub(array, k, pos));
	printf("%d %d",array[pos[0]], array[pos[1]]);
	return 0;
}