B. Levko and Array----二分答案
来源:互联网 发布:java面试知识点总结 编辑:程序博客网 时间:2024/06/05 12:40
Levko has an array that consists of integers: a1, a2, ... , an. But he doesn’t like this array at all.
Levko thinks that the beauty of the array a directly depends on value c(a), which can be calculated by the formula:
It’s time to change the world and Levko is going to change his array for the better. To be exact, Levko wants to change the values of at most k array elements (it is allowed to replace the values by any integers). Of course, the changes should make the array as beautiful as possible.
Help Levko and calculate what minimum number c(a) he can reach.
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 2000). The second line contains space-separated integers a1, a2, ... , an ( - 109 ≤ ai ≤ 109).
A single number — the minimum value of c(a) Levko can get.
5 24 7 4 7 4
0
3 1-100 0 100
100
6 31 2 3 7 8 9
1
In the first sample Levko can change the second and fourth elements and get array: 4, 4, 4, 4, 4.
In the third sample he can get array: 1, 2, 3, 4, 5, 6.
题目链接:http://codeforces.com/contest/360/problem/B
题目的意思是说最多改变数组中k个数,使数组满足c=max(a[i+1]-a[i]) 1<=i<n&&n>1 n<=1时 c=0;也就是说满足两个相邻的数的绝对值差的最大值最小。
这个题一开始看出是二分答案了,但是并没有想出来,去看了网上的博客,但是博客都是二分+dp,我又交了几发,终于让我搞出了二分答案的做法。
f(i)表示前i个的最小修改次数,且i不修改,枚举上一个不修改的位置(感觉我的check里还是融入了dp的思想)。
代码:
#include <cstdio>#include <cstring>#include <iostream>#include <cmath>#define inf 1000000000#define ll long longusing namespace std;int n,k;int a[2005],f[2005];bool check(ll x){ for(int i=1;i<=n;i++){ f[i]=i-1; for(int j=1;j<i;j++){ if(abs(a[i]-a[j])<=(i-j)*x) f[i]=min(f[i],f[j]+(i-j-1)); } if(f[i]+n-i<=k) return 1; } return 0;}int main(){ scanf("%d%d",&n,&k); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } ll l=0,r=2*inf; while(l<=r){ int mid=(l+r)>>1; if(check(mid)){ r=mid-1; } else{ l=mid+1; } } printf("%I64d\n",l); return 0;}
- B. Levko and Array----二分答案
- CF 360B - Levko and Array (二分+dp)
- CodeForces 360 B.Levko and Array(二分+dp)
- Codeforces 360B Levko and Array
- Codeforces #360B: Levko and Array 题解
- 【Coder Force】#360B - Levko and Array(DP 二分枚举)
- CF_360B Levko and Array
- CodeForces 361D Levko and Array(二分+dp)
- Codeforces 361D Levko and Array【二分+dp】好题!
- codeforces 360B Levko and Array (dp神题)
- 记某次codeforces考试 B. Levko and Array
- B. Levko and Permutation
- codeforces D. Levko and Array(二分加dp) 挺好的一个题
- Codeforces Round #210 (Div. 1) B. Levko and Array(dp 思维)
- A. Levko and Array Recovery----思维题
- codeforces #361B. Levko and Permutation
- Codeforce - 361 - B. Levko and Permutation
- Codeforces Round #210 (Div. 1)——Levko and Array
- 八大排序算法
- 剑指offer-07(1):两个队列实现栈
- StringBuffer的使用和特殊字符的覆盖
- 创建存储过程学习-
- 【openwhisk】【FaaS】【serverless】记录
- B. Levko and Array----二分答案
- 华为荣耀6X无法输出日志问题
- ajax中出现js错误不能加载的小问题
- 奥巴马女儿要上哈佛了!从小给女儿定下了五条规矩! 2017-08-07 07:35 哈佛/美国 转载授权请回复“转载“ 文:益美传媒|编辑:Angela 奥巴马曾说自己最骄傲的一件事,就是即使在长
- final、finally和finalize的区别
- php四种基础算法:冒泡,选择,插入和快速排序法
- Spring-属性文件自身的引用03
- 合并k个有序链表
- 笔试题 合并两个有序链表