1007

题意:

求取最大和子序列

分析:

while 读进一个数a时:max = cmax = 0;

1、cmax加上a,更新cend = i,然后如果cmax大于max,则更新max,并且更新end = cend和first=cfirst;如果cmax小于0,更新cfirst = i+1,并且cmax置零;如果cmax等于max,就要分两种情况了,如果cmax=max= 0,说明a等于0,是要更新max,first和end的;如果camx=max!=0,不必处理;

总结:先在这里分析再写代码还是极好的^_^

package AdvancedLevelPractice;

import java.util.Scanner;

public class pat1007 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scanner = new Scanner(System.in);
		int K = scanner.nextInt();
		int[] s = new int[K];
		int max = 0, cmax = 0;
		int first = 0, cfirst = 0;
		int end = K-1, cend = K-1;
		int flag = 0;
		for(int i = 0; i < K; i++){
			s[i] = scanner.nextInt();
			cmax += s[i];
			cend = i;
			if(cmax > max || (cmax == 0 && max == 0)){
				flag = 1;
				max = cmax;
				first = cfirst;
				end = cend;
			}
			
			if(cmax < 0){
				cfirst = i+1;
				cmax = 0;
			}
		}
		System.out.print(max+" "+s[first]+" "+s[end]);
		scanner.close();
	}

}


发布了16 篇原创文章 · 获赞 0 · 访问量 3567
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览