CodeForces 484D Kindergarten
来源:互联网 发布:linux ping不通网关 编辑:程序博客网 时间:2024/06/06 01:34
CodeForces 484D Kindergarten
题目描述:
输入一个
题解:
显然划分出来的每一段都应当是单调的,唯一的问题就是局部极值点划分到左边还是右边,于是直接
题目链接: vjudge 原网站
代码:
#include <cstdio>#include <cstdlib>#include <algorithm>using namespace std;#define MAXN 1000007static int N;static long long val[MAXN], dp[MAXN];int main(){ scanf("%d", &N); for (int i = 0; i < N; i++) scanf("%lld", &val[i]); dp[1] = abs(val[1] - val[0]); for (int i = 2; i < N; i++) if ((val[i-2] <= val[i-1] && val[i-1] >= val[i]) || (val[i-2] >= val[i-1] && val[i-1] <= val[i])) dp[i] = max(dp[i-1], dp[i-2] + abs(val[i] - val[i-1])); else dp[i] = dp[i-1] + abs(val[i] - val[i-1]); printf("%lld\n", dp[N-1]); return 0;}
提交记录(AC / Total = 1 / 2):
0 0
- codeforces 484D kindergarten
- CodeForces 484D Kindergarten
- CodeForces - 484D Kindergarten
- Codeforces 484D-kindergarten
- CodeForces 484D Kindergarten
- Kindergarten - CodeForces 484 D dp
- Codeforces 484D Kindergarten(dp)
- 【codeforces 484D】【DP】Kindergarten
- [Codeforces 484D Kindergarten] DP
- Codeforces 484D. Kindergarten DP贪心
- codeforces 484D Kindergarten 【动态规划】
- CodeForces 484 D.Kindergarten(dp)
- [Codeforces 484D] Kindergarten (DP + 树状数组优化)
- 484D - Kindergarten DP
- Codeforces Round #276 (Div. 1) D. Kindergarten
- Codeforces Round #276 (Div. 1) D. Kindergarten dp
- 1月2日 Codeforces Round #276 (Div. 1) D. Kindergarten
- Kindergarten
- eclipse报错:The project: XXXX which is referenced by the classpath, does not exist.
- XZ_iOS之性能优化——图片文件优化
- 2001年分区联赛普级组之四 装箱问题
- Zabbix-3.2.3实现微信(WeChat)告警
- java中this的用法(1)
- CodeForces 484D Kindergarten
- IntelliJ IDEA 14本地仓库配置
- (转)Android JSON解析之JSONObject与GSON
- opengl顶点数组
- easyUI ComboBox
- sql优化的方法
- 前端HTML的meta设置-前端必看
- 任意结点对最短路问题——Floyd-Warshall算法
- Spring MVC的web.xml配置详解(转)