HDU - 1003 Max Sum O（n）求最大区间和贪心

最新推荐文章于 2022-11-20 18:24:37 发布

Joey丶sunk

最新推荐文章于 2022-11-20 18:24:37 发布

阅读量378

点赞数 1

分类专栏：贪心 JAVA

本文链接：https://blog.csdn.net/xiang_6/article/details/78218508

版权

贪心同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

JAVA

11 篇文章 0 订阅

订阅专栏

练习 JAVA ==

O（n）求最大区间和，算是贪心吧

//package first;

//import java.math.*;
import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for(int i = 1; i <= T; ++i) {
			
			int n = in.nextInt();
			int max_ = -0x7f7f7f7f;
			//System.out.println(max_);
			int sum = 0;
			int l_ = 0, r = 0;
			int x = 0, t = 0;
			for(int j = 0; j < n; ++j) {
				x = in.nextInt();
				sum += x;
				if(sum > max_) { max_ = sum; l_ = t; r = j;}
				if(sum < 0) { sum = 0; t = j+1;} 
			}
			System.out.println("Case " + i + ":");
			System.out.println(max_ + " " + (l_+1) + " " + (r+1));
			if(i < T) System.out.println("");
		}
	}
}