01-复杂度2 Maximum Subsequence Sum (25分)【java实现】

 Java实现代码：

import java.util.Scanner;
import java.io.*;
public class Main {
    private static Reader reader;

    public static void main(String[] args) {
//        Scanner sc = new Scanner(System.in);
        reader=new InputStreamReader(System.in);
        int n=get_int();
        int top=0,bottom=0,temptop=0;
        int[] s=new int[n];
        int flag=0;
        for (int i=0;i<n;i++){
            s[i]=get_int();