Jill Rides Again UVA - 507(求最大子序列和)

题目
Jill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus system for part of her journey. She has a folding bicycle which she carries with her when she uses the bus for the ﬁrst part of her trip. When the bus reaches some pleasant part of the city, Jill gets oﬀ and rides her bicycle. She follows the bus route until she reaches her destination or she comes to a part of the city she does not like. In the latter event she will board the bus to ﬁnish her trip.
Through years of experience, Jill has rated each road on an integer scale of “niceness.” Positive niceness values indicate roads Jill likes; negative values are used for roads she does not like. There are not zero values. Jill plans where to leave the bus and start bicycling, as well as where to stop bicycling and re-join the bus, so that the sum of niceness values of the roads she bicycles on is maximized. This means that she will sometimes cycle along a road she does not like, provided that it joins up two other parts of her journey involving roads she likes enough to compensate. It may be that no part of the route is suitable for cycling so that Jill takes the bus for its entire route. Conversely, it may be that the whole route is so nice Jill will not use the bus at all.
Since there are many diﬀerent bus routes, each with several stops at which Jill could leave or enter the bus, she feels that a computer program could help her identify the best part to cycle for each bus route.

Input
The input ﬁle contains information on several bus routes. The ﬁrst line of the ﬁle is a single integer b representing the number of route descriptions in the ﬁle. The identiﬁer for each route ® is the sequence number within the data ﬁle, 1 ≤ r ≤ b. Each route description begins with the number of stops on the route: an integer s, 2 ≤ s ≤ 20,000 on a line by itself. The number of stops is followed by s−1 lines, each line i (1 ≤ i < s) is an integer ni representing Jill’s assessment of the niceness of the road between the two stops i and i + 1.

Output
For each route r in the input ﬁle, your program should identify the beginning bus stop i and the ending bus stop j that identify the segment of the route which yields the maximal sum of niceness, m = ni + ni+1 + … + nj−1 . If more than one segment is maximally nice, choose the one with the longest cycle ride (largest j −i). To break ties in longest maximal segments, choose the segment that begins with the earliest stop (lowest i). For each route r in the input ﬁle, print a line in the form:
The nicest part of route r is between stops i and j
However, if the maximal sum is not positive, your program should print:
Route r has no nice parts

思路
经典动态规划(也是贪心)问题——求一个序列中最大子序列和，这里简述一下算法：
1：初始化结果ans = 0，累加0到n-1个元素，每一步得到一个和sum；
2：如果某一步中sum > ans，更新ans；
3：如果sum < 0，重置sum为0；
最终ans中储存的即最大子序列和。相关证明需要自行查阅资料。

本体的额外要求是要记录这个和最大的最大子序列的起始点，尽可能的包含更多的元素

代码

#include <iostream>
#include <algorithm>
using namespace std;
int n[20010];
int main()
{int TC, r, cot = 1;scanf("%d", &TC);while(TC--){scanf("%d", &r);int ans = 0, sum = 0, r1 = 1, r2 = 0, ans_r1 = 1, ans_r2 = 0;for(int i = 1; i < r; i++) scanf("%d", &n[i]);for(int i = 1; i < r; i++){sum += n[i]; r2 = i + 1;if(sum < 0){ r1 = i + 1; sum = 0; }else if(sum > ans || (sum == ans && r2 - r1 > ans_r2 - ans_r1)){ ans = sum; ans_r2 = r2; ans_r1 = r1; }}if(ans > 0) printf("The nicest part of route %d is between stops %d and %d\n", cot++, ans_r1, ans_r2);else printf("Route %d has no nice parts\n", cot++);}
}

Jill Rides Again UVA - 507(求最大子序列和)相关推荐

LeetCode算法题3:求最大子序列和
文章目录前言一.递归二.求最大子序列和 1,最朴素的解法 2,较朴素的解法(更进一步) 3,分治和递归 4,精妙的解法总结前言本文简单介绍递归的使用(依次打印出一个 int 整数的每一位) ...
算法探讨——再议经典算法问题：求最大子序列和、绝对值最大子序列和以及其区间...
算法探讨--再议经典算法问题:求最大子序列和.绝对值最大子序列和以及其区间给定任一数字序列,如{-5,4,-20,16,-2,-3},求出其最大子序列和,绝对值最大子序列和以及对应的区间,在这个例子 ...
求连续子序列平均最大权值的问题
原题链接求长度为n.m(<=1e5)的a,b两组数组一段长度不小于x.y的连续子序列平均最大权值. 分析: 要求一个数组a长度不小于len的连续子序列平均最大权值. 二分答案x,令b[i]=a ...
Uva 507 - Jill Rides Again(最大子数组求和问题)
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&a ...
求最大子序列和的四种方法
求一个给定序列的连续子序列中和最大的那个子序列的和,下边方法只求和,没有找出最大子序列. 用到的头文件和宏定义如下 #include "stdafx.h" #include< ...
Maximum Sum UVA - 108（连续子序列最大和—变形之子矩阵最大和）
题目大意:给出 n*n 的矩阵,找每隔数字之和最大的子矩阵,输出最大和. 解题思路:枚举矩阵左上和右下的坐标,分别合并子矩阵的每列,使得二维转化为一维,然后利用连续子序列最大和去做就行. Time ...
求最大子序列和（动态规划）
最大子序列和描述: 给定一个序列a[1],a[2],a[3]......a[n],你的工作是计算一个子序列的最大和.例如,给定(6,-1,5,4,-7),这个序列的最大和是6+(-1)+5+4=14 ...
动态规划１：状态转移方程-求最大子序列和
时间复杂度O(n) 序列:-2 11 -4 13 -5 -2 //最大连续子序列和 //使用到状态转移方程 #include <cstdio> #include "algorit ...
ICPC训练联盟2021寒假冬令营(4)_2021.01.21_笔记
文章目录试题链接学习笔记-排序算法( O(n^2^)时间复杂度 ) 选择排序程序段(C++) 冒泡排序程序段(C++) 插入排序程序段 A - Necklace (UVA 11001) 中文释义 ...
动态规划法求最大字段和时间复杂度_九章算法 | 动态规划：最长上升子序列
给定一个整数序列,找到最长上升子序列(LIS),返回LIS的长度. 在线评测地址:LintCode 领扣说明最长上升子序列的定义: 最长上升子序列问题是在一个无序的给定序列中找到一个尽可能长的由低 ...

Jill Rides Again UVA - 507(求最大子序列和)

Jill Rides Again UVA - 507(求最大子序列和)相关推荐

最新文章

热门文章