[PAT]1007. Maximum Subsequence Sum (25)@Java
来源:互联网 发布:万国数据怎么样 编辑:程序博客网 时间:2024/06/06 20:51
1007. Maximum Subsequence Sum (25)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.
Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.
Input Specification:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.
Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.
Sample Input:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:
10 1 4
package go.jacob.day826;import java.util.Scanner;/** * 1007. Maximum Subsequence Sum (25) * * @author Jacob * 注意:认真阅读题目,输出格式为:最大和序列 序列第一个数字(不是下标) 序列最后一个数字(不是下标) */public class Demo3 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int N = sc.nextInt();int[] arr = new int[N];for (int i = 0; i < N; i++)arr[i] = sc.nextInt();int max = Integer.MIN_VALUE, maxBegin = 0, maxEnd = 0;int sum = 0, tmpBegin = 0, tmpEnd = 0;for (int i = 0; i < N; i++) {if (sum < 0) {sum = 0;tmpBegin = arr[i];}sum += arr[i];tmpEnd = arr[i];if (sum > max) {max = sum;maxBegin = tmpBegin;maxEnd = tmpEnd;}}if (max >= 0)System.out.println(max + " " + maxBegin + " " + maxEnd);else//结果小于0特殊处理System.out.println(0 + " " + arr[0] + " " + arr[N - 1]);sc.close();}}
- [PAT]1007. Maximum Subsequence Sum (25)@Java
- 1007. Maximum Subsequence Sum (25)-PAT
- 【PAT】1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum (25)
- PAT A 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT-1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- iOS自动布局框架之Masonry
- shell解析命令行的过程以及eval命令
- centos7下安装apache,mysql,php 合集
- C++编程->Winpcap网络数据保存为pcap文件
- 剑指offer:和为S的连续正数序列
- [PAT]1007. Maximum Subsequence Sum (25)@Java
- view group adapter的封装
- 从尾到头打印链表java实现
- 【二叉树】637. Average of Levels in Binary Tree
- Dom和sax解析的比较
- Java增强for遍历LinkedList所引发的思考
- Java程序猿快速上手PHP
- 使用openswan搭建ipsec vpn
- 1207:水仙花数