HDU-1003 JAVA_hduoj1003 java-优快云博客

本文链接：https://blog.youkuaiyun.com/fores_t/article/details/103850994

本文详细介绍了一个用于求解序列中最大子序列和的算法——MaxSum。通过实例展示，如序列(6,-1,5,4,-7)，算法能快速找出最大和为14的子序列。文章还提供了一段Java实现代码，帮助读者理解算法的具体实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 342688 Accepted Submission(s): 81477

Problem Description
Given a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output
For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

Case 1:
14 1 4

Case 2:
7 1 6

Author
Ignatius.L

代码写的很长，比较粗糙，待改

import java.util.Scanner;

public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int count=sc.nextInt();
        int op=1;
        while(count-->0){
            int shu =sc.nextInt();
            int a[]=new int [100000];
            int b[][]=new int [100000][2];
            int i=0;
            while(shu-->0){
                a[i]=sc.nextInt();
                i++;
            }
            b[0][0]=a[0];
            for(int j=1;j<i;j++){
                if(b[j-1][0]+a[j]>=a[j]){
                    b[j][0]=b[j-1][0]+a[j];
                    b[j][1]=b[j-1][1];
                }else{
                    b[j][0]=a[j];
                    b[j][1]=j;
                }
            }
            int max=-1001;
            int start=0;
            int end=0;
            for(int x=0;x<i;x++){
                if(b[x][0]>=max){
                    max=b[x][0];
                    start=b[x][1];
                    end=x;
                }
            }
            System.out.println("Case "+op+++":");
            System.out.println(max+" "+(start+1)+" "+(end+1));
            if(count!=0){
                System.out.println("");
            }
        }
    }
}