讨论1.7-01-复杂度1-最大子列和问题-算法2-简单粗暴

来源：互联网发布：打谱软件下载编辑：程序博客网时间：2024/06/08 08:09

最大子列和问题

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int num = input.nextInt();int[] a = new int[num];for (int i = 0; i < a.length; i++) {a[i] = input.nextInt();}System.out.print(maxSubseqSum2(a));}public static int maxSubseqSum2(int a[]){int thisSum,maxSum = 0;for (int i = 0; i < a.length; i++) {thisSum = 0;for (int j = i; j < a.length; j++) {thisSum += a[j];if (thisSum  > maxSum) {maxSum = thisSum;}}}return maxSum;}}

评测结果时间结果得分题目编译器用时（ms）内存（MB）用户2015-09-10 21:45答案正确2001-复杂度1javac2836031hjh399测试点结果测试点结果得分/满分用时（ms）内存（MB）要点提示测试点1答案正确12/121449sample 有正负，负数开头结尾，最大和有更新测试点2答案正确2/214910100个随机数测试点3答案正确2/2238111000个随机数测试点4答案正确2/26052210000个随机数测试点5答案正确2/22836031100000个随机数

0 0