zoukankan      html  css  js  c++  java
  • CodeForces

    Discription

    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:

    The less value c(a) is, the more beautiful the array is.

    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.

    Input

    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).

    Output

    A single number — the minimum value of c(a) Levko can get.

    Examples

    Input
    5 2
    4 7 4 7 4
    Output
    0
    Input
    3 1
    -100 0 100
    Output
    100
    Input
    6 3
    1 2 3 7 8 9
    Output
    1

    Note

    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.

       二分答案之后直接dp就行啦,水水水hhhh

    #include<bits/stdc++.h>
    #define ll long long
    using namespace std;
    const int maxn=20005,inf=2*1e9;
    int n,a[maxn],f[maxn],k,mid;
    inline int mabs(int x){ return x<0?-x:x;}
    
    inline bool solve(){
    	for(int i=1;i<=n;i++){
    		f[i]=i-1;
    		for(int j=1;j<i;j++) if(mabs(a[i]-a[j])<=(i-j)*(double)mid) 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);
    	
    	int l=0,r=inf,ans;
    	while(l<=r){
    		mid=(l+(ll)r)>>1;
    		if(solve()) r=mid-1,ans=mid;
    		else l=mid+1;
    	}
    	
    	printf("%d
    ",ans);
    	return 0;
    }
    

      

  • 相关阅读:
    Nginx 利用 X-Accel-Redirect response.setHeader 控制文件下载
    Nginx 利用 X-Accel-Redirect response.setHeader 控制文件下载
    CentOS6.4 安装OpenResty和Redis 并在Nginx中利用lua简单读取Redis数据
    CentOS6.4 安装Sphinx 配置MySQL数据源
    在线编译
    Java 日期格式化工具类
    CentOS6.4 安装MongoDB
    yum安装高版本mysql(5.5)
    解决Windows Server 2003不认U盘或移动硬盘的问题
    配置tomcat日志分割
  • 原文地址:https://www.cnblogs.com/JYYHH/p/8985367.html
Copyright © 2011-2022 走看看