动态规划入门1
来源:互联网 发布:漫画形象设计软件 编辑:程序博客网 时间:2024/05/21 16:58
问题:
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
输入:
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
输出:
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
题意:求最大和的最长序列,输出这些数的总和和序列的起始点和终点
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int main()
{
int nase,n,num,start,end,temp,i,j,a[100010],sum,max;
scanf("%d",&nase);
for(i=1;i<=nase;i++)
{
max=-1111;
sum=0;
start=end=temp=1;
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%d",&num);
sum+=num;
if(sum>max)
{
max=sum;
start=temp;
end=j;
}
if(sum<0)
{
sum=0;
temp=j+1;
}
}
printf("Case %d:\n",i);
printf("%d %d %d\n",max,start,end);
if(i!=nase)
printf("\n");
}
return 0;
}
0 0
- 动态规划入门1
- 动态规划DP入门 0-1背包
- 动态规划小入门
- 动态规划入门
- 动态规划入门
- 动态规划经典入门
- 动态规划 入门学习
- 动态规划入门
- 动态规划入门_hdu_1421
- 动态规划入门例子
- 动态规划趣味入门
- 动态规划入门详解
- 动态规划入门
- 动态规划入门
- 动态规划算法入门
- 动态规划入门篇
- 动态规划入门练习
- 动态规划算法入门
- EL表达式相等、不相等符号
- 为什么CCD尺寸标注为1“,但宽高分别为12.8mm*9.6mm?
- Jquery 1.6+ 以上 attr("checked") 返回的不是 bool 类型!!!
- navicat 11.0 for linux 破解误区
- 安装Nginx作为Windows服务自启动运行
- 动态规划入门1
- 关于java web中get方法的解决中文乱码问题
- 贪心算法-Dijkstra单源最短路径
- 请保证您的文章为原创作品
- Codeforces 39J Spelling Check hash
- html代码设置textview字体颜色
- 面向对象——String类综述。
- 应用 yacc 和lex 实现 语法分析与词法分析 之复杂四则运算
- js判断为空Null与字符串为空简写方法