Hi,

I am trying to develop an efficient algorithm for maximum subsequence sum. But I am stuck.

I want to return the start and the end of the subsequence producing the maximum sum.

Example Array Contains...

-2,11,-4,13,-5,-2

Now my algorithm works as follow.

```
MSS(Array[],N)//Where N is the number of elements in array
{
sum=0; //current sum
max-sum=0;//Maximum Sum
seq-start=0;//start of the subsequence
seq-end=0;//end of the subsequence
for(i=0;i<N;i++){
sum=sum+Array[i];
if(sum<0){
sum=0;
seq-start++;
}
else{
if(sum>max-sum)
max-sum=sum;
seq-end++;
}
}
}
```

Please help in this regard.

Thanks