PAT1007:Maximun Subsequence Sum Java语言实现

public class Test2 {

public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a={-1,3,-2,4,-6,-1,1,6,-1,2};
int[] b=getMaxSub(a);

for(int i=0;i<b.length
;i++){
System.out.println(b[i]);
}
}

public static int[] getMaxSub(int[] a){
int[] ret=new int[3];

int maxNum=0;
int thisNum=0;
int first=0;
int last=0;
int tmpfirst=0;
for(int i=0;i<a.length;i++){
thisNum+=a[i];
if(thisNum<0){
thisNum=0;
tmpfirst=i+1;
}

if(maxNum<thisNum){
maxNum=thisNum;
last=i;
first=tmpfirst;
}
}
ret[0]=maxNum;
ret[1]=first;
ret[2]=last;
return ret;
}

}