PAT-A Maximum Subsequence Sum

是道常规的动态规划题，不过我有被卡住（丢脸
需要考虑当序列整体求和为0的情况。

#include<bits/stdc++.h>
using namespace std;int main()
{int k;vector<int> v;scanf("%d", &k);int temp;bool all_negative = true;for(int i = 0; i < k; i++){scanf("%d", &temp);v.push_back(temp);if(temp >= 0)all_negative = false;}if(all_negative == true){printf("0 %d %d", v[0], v[k-1]);return 0;}int dp[10005] = {v[0]};int tempi = 0, maxi = 0, maxj = 0;int maxn = dp[0];for(int i = 1; i < k; i++){if(v[i] > dp[i-1] + v[i])tempi = i;dp[i] = max(dp[i-1] + v[i], v[i]);if(dp[i] > maxn){maxn = dp[i];maxi = tempi;maxj = i;}}printf("%d %d %d", maxn, v[maxi], v[maxj]);return 0;
}

PAT-A Maximum Subsequence Sum相关推荐

PAT 1007 Maximum Subsequence Sum
1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N1, N2, ..., NK }. A c ...
PAT -A-1007 Maximum Subsequence Sum 简单动态规划
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to ...
PAT甲级1007 Maximum Subsequence Sum ：[C++题解]DP，最大子序列和、求最优的区间方案
文章目录题目分析题目链接题目分析来源:acwing 分析: dp题. 这道题糅合了两个知识点: dp求最值(区间之和) 动态求区间方案:区间之和相等的条件下:要求区间左端点最靠前,如果左端点相 ...
【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 (25 分)
题目详情 - 1007 Maximum Subsequence Sum (25 分) (pintia.cn) Given a sequence of K integers { N1, N2, .. ...
PAT甲级真题-1007 Maximum Subsequence Sum详解优化
1007 Maximum Subsequence Sum 题目链接 https://pintia.cn/problem-sets/994805342720868352/problems/9948055 ...
1007 Maximum Subsequence Sum
1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N1, N2, ..., NK }. A c ...
PTA 01-复杂度2 Maximum Subsequence Sum (25分)
题目地址 https://pta.patest.cn/pta/test/16/exam/4/question/663 5-1 Maximum Subsequence Sum (25分) Given ...
7-1 Maximum Subsequence Sum
7-1 Maximum Subsequence Sum(25 分) Given a sequence of K integers { N1, N2, ..., NK }. A con ...
1007 Maximum Subsequence Sum
1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N1, N2, ..., NK }. A continu ...

PAT-A Maximum Subsequence Sum

PAT-A Maximum Subsequence Sum相关推荐

最新文章

热门文章