PAT(Advanced) 1007 Maximum Subsequence Sum (25)

2018/4/20


// 注意题目说的，当所有的数都是非负数（有0不算）的时候最大数为0
// 输出最大子序列和的首、末元素值，而不是下标#include <iostream>
using namespace std;int num[10005];int main(){int maxnum = 0, start, endnum;int n;bool flag = false;cin >> n;for(int i = 0; i < n; i++){cin >> num[i];if(num[i] >= 0)flag = true;}if(flag == false){cout << maxnum << ' ' << num[0] << ' ' << num[n-1] << endl;return 0;}for(int i = 0; i < n; i++){int cursum = 0;for(int j = i; j < n; j++){cursum += num[j];if(cursum > maxnum){maxnum = cursum;start = num[i];endnum = num[j];}}}cout << maxnum << ' ' << start << ' ' << endnum << endl;return 0;
}

PAT(Advanced) 1007 Maximum Subsequence Sum (25)相关推荐

PAT甲级--1007 Maximum Subsequence Sum (25 分)
题目详情 - 1007 Maximum Subsequence Sum (25 分) (pintia.cn) Given a sequence of K integers { N1, N2, .. ...
PAT甲级 -- 1007 Maximum Subsequence Sum (25 分)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to ...
PAT A 1007. Maximum Subsequence Sum (25)
原题 Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { ...
PAT甲级1007 Maximum Subsequence Sum (25 分)题解
\quad 这是最大子序列和问题,是一个典型的动态规划题目,我在博客中对几个常见的动态规划算法进行了分析.设输入的数保存在数组a[max]中,那么转移方程为dp[i]=max(dp[i-1]+a[i] ...
【PAT甲】1007 Maximum Subsequence Sum (25分)，求最大字段和及区间
problem 1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N 1 , N 2 , -, N ...
PAT甲级1007 Maximum Subsequence Sum ：[C++题解]DP，最大子序列和、求最优的区间方案
文章目录题目分析题目链接题目分析来源:acwing 分析: dp题. 这道题糅合了两个知识点: dp求最值(区间之和) 动态求区间方案:区间之和相等的条件下:要求区间左端点最靠前,如果左端点相 ...
1007. Maximum Subsequence Sum (25)-PAT甲级真题（最大连续子序列和、动态规划dp）
Given a sequence of K integers { N1, N2, -, NK }. A continuous subsequence is defined to be { Ni, Ni ...
【测试点5】1007 Maximum Subsequence Sum (25 分)
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Given a sequence of K integers { N1 , N2 , -, NK }. A co ...
1007 Maximum Subsequence Sum (25 分) java 题解
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { N ...

PAT(Advanced) 1007 Maximum Subsequence Sum (25)

PAT(Advanced) 1007 Maximum Subsequence Sum (25)相关推荐

最新文章

热门文章