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 ...
最新文章
- elasticsearch 5.x Delete By Query API（根据条件删除）
- 独家 | 大数据与AI技术在金融科技的应用
- boost::hana::while_用法的测试程序
- 【解题报告】Leecode 372. 超级次方——Leecode每日一题系列
- 想学好编程，别背代码！
- 高频面试题2：单例设计模式
- k均值的损失函数_K-Means算法的实现
- thinkphp框架环境部署
- Linux下rpm安装jdk17
- 中国智慧园区标准化白皮书 附下载
- SSM高校疫情防控出入信息管理系统设计与实现.rar（论文+源码）
- 大型sql文件拆分工具软件
- 烘焙软件Knald介绍
- 获取基因的所有转录本（不同亚型）的外显子区域
- 校园招聘-2017携程秋招后台开发笔试编程题
- Ubuntu安装时，U盘启动盘制作的坑
- 112-RTKLIB中关于dcb文件读取的问题
- 数据对比中的颜色配置（红绿）
- JavaScript 删除 HTML 元素
- 苹果手机的html 手势，点击事件