UVA - 1372 Log Jumping
来源:互联网 发布:每天最佳健身时间 知乎 编辑:程序博客网 时间:2024/06/04 23:23
题意:给你n个长为k的横木,并给出左坐标,如果两个横木能都有重叠部分或临界的话,那么这两个横木就可以互相跳跃,问能形成多大的环
思路:排序后,假设当前的i是环里的,如果满足 x[i+1]-x[i-1]<=k && x[i+1]-x[i]<=k 的话,那么i+1块也可以加进环里
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int MAXN = 6000;int x[MAXN],k,n;int main(){ int t; scanf("%d",&t); while (t--){ scanf("%d%d",&n,&k); for (int i = 1; i <= n; i++) scanf("%d",&x[i]); sort(x+1,x+1+n); int i = 1; int ans = 0; while (i <= n){ int pre = i; int cnt = 1; while (i < n && (cnt == 1 || x[i+1]-x[i-1] <= k) && x[i+1]-x[i] <= k) i++,cnt++; if (pre == i) i++; ans = max(ans,cnt); } printf("%d\n",ans); } return 0;}
0 0
- UVA - 1372 Log Jumping
- uva 1372 - Log Jumping(贪心)
- UVA 1372 - Log Jumping(推理)
- UVALive 3610 Log Jumping
- UVa 11764 - Jumping Mario
- UVA 10868 - Bungee Jumping
- UVA 10868 - Bungee Jumping
- UVa 10868 - Bungee Jumping
- UVa 914 - Jumping Champion
- UVA 10868(p345)----Bungee Jumping
- UVALive 3610 Log Jumping(贪心)
- UVa 10868 - Bungee Jumping(物理公式)
- Super Jumping! Jumping! Jumping!
- hdoj_1087Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- PowerDesigner导出mysql脚本里包含视图
- macbook装机注意事项&&双系统崩溃解决办法
- 获取android应用签名证书(打包APK用到的那个文件)的SHA1,MD5,SHA256值
- poj3740 Easy Finding DLX
- MySQL server has gone away报错原因分析
- UVA - 1372 Log Jumping
- hduoj-1051-Wooden Sticks
- GDB调试之TUI界面
- 23-Linux-软件包管理-YUM
- UVA 10534 Wavio Sequence (双向LIS)
- Javascript Function 对象 属性和方法
- Dojo 学习笔记–dojo模块引用 和上下文绑定
- dojo 学习日记 之 数组操作
- JavaScript 的继承机制(图文)