Feel Good - UVa 1619 dp
来源:互联网 发布:nginx 绑定多个域名 编辑:程序博客网 时间:2024/05/22 02:20
Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life.
A new idea Bill has recently developed assigns a non-negative integer value to each day of human life. Bill calls this value the emotional value of the day. The greater the emotional value is, the better the day was. Bill suggests that the value of some period of human life is proportional to the sum of the emotional values of the days in the given period, multiplied by the smallest emotional value of the day in it. This schema reflects that good on average period can be greatly spoiled by one very bad day.
Now Bill is planning to investigate his own life and find the period of his life that had the greatest value. Help him to do so.
Input
The input will contain several test cases, each of them as described below. Consecutive test cases are separated by a single blank line.
The first line of the input file contains n - the number of days of Bill's life he is planning to investigate (1n100000) . The rest of the file contains n integer numbers a1, a2,..., an ranging from 0 to 106 - the emotional values of the days. Numbers are separated by spaces and/or line breaks.
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
On the first line of the output file print the greatest value of some period of Bill's life.
On the second line print two numbers l and r such that the period from l -th to r -th day of Bill's life (inclusive) has the greatest possible value. If there are multiple periods with the greatest possible value, then print the shortest one. If there are still several possibilities, print the one that occurs first..
Sample Input
6 3 1 6 4 5 2
Sample Output
60 3 5
题意:所求值为一段时间的总和乘以值最小的点,并输出时间范围,时间范围相同时,输出最早的。
思路:用l[i],r[i]记录第i天时的连续区间的最左端点和最右端点。具体看代码吧,还有注意0 0 0 0这组数据。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;long long sum[100010],l[100010],r[100010],value[100010],ans,x,y;int main(){ long long n,i,j,k,t=0; sum[0]=0; while(~scanf("%lld",&n)) { ans=-1; for(i=1;i<=n;i++) { scanf("%lld",&value[i]); sum[i]=sum[i-1]+value[i]; l[i]=i;r[i]=i; } value[0]=value[n+1]=-1; for(i=1;i<=n;i++) if(value[i]>0) while(value[l[i]-1]>=value[i]) l[i]=l[l[i]-1]; for(i=n;i>=1;i--) if(value[i]>0) while(value[r[i]+1]>=value[i]) r[i]=r[r[i]+1]; for(i=1;i<=n;i++) { k=value[i]*(sum[r[i]]-sum[l[i]-1]); if(k>ans) { ans=value[i]*(sum[r[i]]-sum[l[i]-1]); x=l[i];y=r[i]; } else if(k==ans) { if(r[i]-l[i]<y-x) { x=l[i];y=r[i];} else if(r[i]-l[i]==y-x && l[i]<x) { x=l[i];y=r[i];} } } if(t!=0) printf("\n"); t++; printf("%lld\n%lld %lld\n",ans,x,y); }}
- Feel Good - UVa 1619 dp
- UVA 1619 Feel Good(DP)
- UVa 1619 Feel Good
- UVa - 1619 - Feel Good
- uva 1619 - Feel Good
- UVA 1619 Feel Good
- UVA 1619(p256)----Feel Good
- 【UVA】1619-Feel Good(数据结构-栈)
- UVA - 1619 Feel Good 标记+枚举
- UVa 1619:Feel Good(单调栈)
- Feel Good UVA
- [UVA1619]Feel Good[DP]
- UVA 1619 - Feel Good(dp 求区间最小值 附加RMQ)(区间最小值优化)
- UVA - 1619 Feel Good(高效算法:滑动窗口)
- UVA 1619Feel Good 感觉不错 迭代法 (2005 NE)
- [UVa 1619] Feel Good (单调栈+前缀和)
- POJ 2796 Feel Good -- 单调栈,DP
- poj 2796 Feel Good 单调栈/dp
- 【安卓笔记】快速开发设置界面-----PreferenceActivity
- 【Visual C++】游戏开发笔记三十三 浅墨DirectX提高班之二 化腐朽为神奇:DirectX初始化四步曲
- zoj1424 Painting A Board
- OpenGL相关函数库介绍
- 【Visual C++】游戏开发笔记三十四 浅墨DirectX提高班之三 起承转合的艺术:Direct3D渲染五步曲
- Feel Good - UVa 1619 dp
- 使用OJ评判C/C++程序可能出现的问题总结
- Linux系统编程(12)——shell基础
- scanf函数浅析
- 仿MIUI音量变化环形进度条实现
- poj1330
- 【Visual C++】游戏开发笔记三十六 浅墨DirectX提高班之四 顶点缓存的逆袭
- 算法学习-数据结构之链表操作,创建,插入,删除,查找。
- 游戏中使用的子弹