Maximum Subsequence Sum

最新推荐文章于 2024-11-02 15:52:57 发布

DMDMCAR

最新推荐文章于 2024-11-02 15:52:57 发布

阅读量57

点赞数

分类专栏：数据结构文章标签： java

本文链接：https://blog.csdn.net/ZDQQQqq/article/details/124175666

版权

数据结构专栏收录该内容

26 篇文章 0 订阅

订阅专栏

编程语言：Java
题目：
在这里插入图片描述
题解：这里选择了先存储再处理，结果值更新的同时也要更新下标
结果：AC

import java.io.*;
import java.util.Scanner;

public class Main {
    static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
    static Scanner sc = new Scanner(new BufferedInputStream(System.in));
    
    static int k;
    static long res = -1;
    static int tarl, tarr;
    static int[] a;

    public static void main(String[] args) throws IOException {
        in.nextToken();
        k = (int) in.nval;
        a = new int[k];
        for (int i = 0; i < k; i++) {
            in.nextToken();
            a[i] = (int) in.nval;
        }
        int i =-1;
        while (i < k) {
            i=find(i+1);
            int j = i;
            int sum = 0;
            while (j < k) {
                sum += a[j];
                if (sum < 0)
                    break;
                else if (sum > res) {
                    tarl = i;
                    tarr = j;
                    res = sum;
                }
                j++;
            }
        }
        if (res != -1)
            System.out.println(res + " " + a[tarl] + " " + a[tarr]);
        else
            System.out.println("0 " + a[0] + " " + a[k - 1]);
    }

    private static int find(int i) {
        int j = i;
        for (; j < k; j++) {
            if (a[j] > -1) break;
        }
        return j;
    }
}