首页 > 代码库 > Algorithm for Maximum Subsequence Sum z
Algorithm for Maximum Subsequence Sum z
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++; } } }
Algorithm for Maximum Subsequence Sum
Example Array Contains...
-2,11,-4,13,-5,-2
Now my algorithm works as follow.
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。