CodeForces #Pi D.One-Dimensional Battle Ships
来源:互联网 发布:淘宝店铺出售法律风险 编辑:程序博客网 时间:2024/05/22 14:14
题目大意:
给定一个区间,每次除去一个点,要求在剩下的空白里能放下k个长为a的区间。
解题思路:
直接用set保存当前分割的区间就可以了。总复杂度为n * logn
#include <cstring>#include <cstdio>#include <cmath>#include <queue>#include <map>#include <set>#define LL long long#define MAX 2147483647using namespace std;set <int> s;int n,k,a,m,b;int max(int x,int y){if (x>y) return x;else return y;}int min(int x,int y){if (x<y) return x;else return y;}int main(){scanf("%d%d%d",&n,&k,&a);scanf("%d",&m);s.clear();int sum=(n+1)/(a+1);s.insert(0); s.insert(n+1);int ans=-1;bool flag=0;for (int i=1;i<=m;i++){ scanf("%d",&b);set<int>::iterator it=s.upper_bound(b);int y=*it;int x=*(--it);sum-=(y-x)/(a+1)-(y-b)/(a+1)-(b-x)/(a+1);if (sum<k && !flag) ans=i, flag=1;s.insert(b);}printf("%d",ans);return 0;}
0 0
- CodeForces #Pi D.One-Dimensional Battle Ships
- Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships
- codeforces 567D. One-Dimensional Battle Ships
- Codeforces 567D One-Dimensional Battle Ships
- CodeForces 567D One-Dimensional Battle Ships
- Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships 二分 stl应用
- D. One-Dimensional Battle Ships-二分答案-Codeforces Round #Pi (Div. 2)
- Codeforces Round #Pi (Div. 2)567D One-Dimensional Battle Ships(set)
- Codeforces Round #Pi (Div. 2) —— D One-Dimensional Battle Ships
- STL(set_pair)运用 CF#Pi D. One-Dimensional Battle Ships
- Codeforences Round #PI(div2) D. One-Dimensional Battle Ships
- Codeforces Round #Pi (Div. 2)_D. One-Dimensional Battle Ships
- One-Dimensional Battle Ships CodeForces
- codeforces(567D)--D. One-Dimensional Battle Ships
- codeforces 567D One-Dimensional Battle Ships (map维护)
- codeforces 567D One-Dimensional Battle Ships (set)
- CodeForces 567D One-Dimensional Battle Ships【二分】
- CF D. One-Dimensional Battle Ships
- BadParcelableException:Parcelable protocol requires a Parcelable 错误
- 九度OJ 题目1031:xxx定律
- session与cookie的区别
- 图的深度遍历
- iOS 使用category将复杂的类拆分
- CodeForces #Pi D.One-Dimensional Battle Ships
- 九大排序算法总结
- GDOI模拟 20150806
- 数据离散化
- 最大二分匹配hdu5093
- HDoj 4496 D-City(并查集)
- 1.设计模式概述
- 屏保
- Doing Homework again SDUT 2076