CodeForces 567D One-Dimensional Battle Ships
来源:互联网 发布:怎样查看淘宝信誉等级 编辑:程序博客网 时间:2024/05/01 23:55
题意:有一个一维线段,上面摆了k个船,每个船的长度都为a,然后有一个人来打,问你第几次攻击 就可以使得这个船无论怎么摆都不合法了
思路:一个区间合并的题,对于每一次的攻击,都只会影响到这个点所在区间,然后我们更新一下新出现的两个区间里面能摆多少个船就好了
#include<bits/stdc++.h>using namespace std;set<int>s;map<int,int>vis;int main(){ int n,k,a;scanf("%d%d%d",&n,&k,&a);int ans = (n+1)/(a+1);int m;scanf("%d",&m);s.insert(0);s.insert(n+1);for (int i = 0;i<m;i++){int x;scanf("%d",&x);if (vis[x])continue;vis[x]=1;int c = *s.lower_bound(x);int d = *--s.lower_bound(x);s.insert(x);ans-=(c-d)/(a+1);ans+=(c-x)/(a+1)+(x-d)/(a+1);if (ans <k){printf("%d\n",i+1);return 0;}}printf("-1\n");}
0 0
- codeforces 567D. One-Dimensional Battle Ships
- Codeforces 567D One-Dimensional Battle Ships
- CodeForces 567D One-Dimensional Battle Ships
- codeforces(567D)--D. One-Dimensional Battle Ships
- CodeForces #Pi 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【二分】
- One-Dimensional Battle Ships CodeForces
- Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships
- codeforces#314D&567D One-Dimensional Battle Ships (Set)
- Codeforces Round #Pi (Div. 2)567D One-Dimensional Battle Ships(set)
- [CodeForces 567D] One-Dimensional Battle Ships (区间隔断计数)
- 【打CF,学算法——三星级】CodeForces 567D One-Dimensional Battle Ships (二分)
- CF 567D(One-Dimensional Battle Ships-二分)
- 567D One-Dimensional Battle Ships(set)
- CF D. One-Dimensional Battle Ships
- 【CodeForces】567D - One-Dimensional Battle Ships & 【51Nod】1521 - 一维战舰(STL - set & 二分)
- 数据统计(原始版,重定向版,fopen版)
- gradle升级更新
- iOS开发 - CocoaPods安装和使用教程
- lightoj1207Posters_For_Election&&POJ2528
- Android 单元测试--系列一
- CodeForces 567D One-Dimensional Battle Ships
- datalab 数据表示实验
- leetcode78、90-Subsets I/II(组合数/子集数目)
- Javascript中的自执行匿名函数
- [数据库] MySql查询优化技巧
- spring 依赖注入DI-个人学习笔记
- javascript: 基于原型的面向对象编程
- 330. Patching Array
- MJExtension使用详解