POJ 3258.River Hopscotch

最新推荐文章于 2021-10-20 20:01:33 发布

零式之风

最新推荐文章于 2021-10-20 20:01:33 发布

阅读量155

点赞数

分类专栏： poj 文章标签： c语言 poj

本文链接：https://blog.csdn.net/njyexiong/article/details/78754887

版权

poj 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

题目:http://poj.org/problem?id=3258

AC代码(C++):

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <map>
#include <math.h>
#include <string>
#include <string.h>
#include <bitset>

#define INF 0x7fffffff
#define MAXN 100105

using namespace std;

struct cmp1  
{  
     bool operator ()(int x, int y)  
    {  
        return x > y;
    }  
};

int l,n,m;
int low,high,mid;
int a[50010];

bool isBigger(){
	int cnt = 0;
	int last = 0;
	for(int i = 1; i <= n + 1; i++){
		if(a[i]-a[last]<mid)cnt++;
		else last = i;
	}
	if(cnt>m)return true;
	else return false;
}

int main(){
	priority_queue<int, vector<int>, cmp1>q;
	cin>>l>>n>>m;
	low = INF;
	high = 0;
	a[0] = 0;
	a[n + 1] = l;
	int tmp;
	for(int i = 1; i <= n; i++){
		scanf("%d",&tmp);
		q.push(tmp);
	}
	for(int i = 1; i <= n; i++){
		a[i] = q.top();
		q.pop();
		if(a[i]-a[i-1]>high)high = a[i]-a[i-1];
		if(a[i]-a[i-1]<low)low = a[i]-a[i-1];
	}
	if(a[n+1]-a[n]>high)high = a[n+1]-a[n];
	if(a[n+1]-a[n]<low)low = a[n+1]-a[n];
	mid = (low+high)/2;
	while(low<=high){
		if(isBigger())high = mid - 1;
		else low = mid + 1;
		mid = (low+high)/2;
	}
	cout<<mid;
}