[CF538C]Tourist's Notes
来源:互联网 发布:刷qq会员永久软件 编辑:程序博客网 时间:2024/06/08 02:59
题目大意
懒得写
做法
每一段内求个最高,列不等式。
#include<cstdio>#include<algorithm>#define fo(i,a,b) for(i=a;i<=b;i++)using namespace std;const int maxn=100000+10;int d[maxn],h[maxn];int i,j,k,l,t,n,m,x,y,ans;bool czy;int main(){ scanf("%d%d",&n,&m); fo(i,1,m) scanf("%d%d",&d[i],&h[i]); ans=max(h[1]+d[1]-1,h[m]+n-d[m]); //d[0]=1; czy=1; fo(i,1,m-1){ y=d[i+1]-d[i]; x=(h[i+1]+y-h[i])/2; ans=max(ans,h[i]+x); if (h[i]<h[i+1]&&h[i]+y<h[i+1]) czy=0; else if (h[i]>h[i+1]&&h[i]-y>h[i+1]) czy=0; } if (!czy) printf("IMPOSSIBLE\n"); else printf("%d\n",ans);}
阅读全文
0 0
- [CF538C]Tourist's Notes
- CF 538C(Tourist's Notes-贪心)
- Codeforces Round #300-Tourist's Notes(贪心)
- codeforces #300 C. Tourist's Notes
- #300 (div.1 2) C. Tourist's Notes
- CodeForce 538C Tourist's Notes(贪心 + 数学)
- CodeForces 538C Tourist's Notes (简单题)
- Code Forces 538 C. Tourist's Notes(贪心)
- codefores 538-C. Tourist's Notes(数学)
- NHibernate's notes
- Notes: Email's protocol
- Notes of Hinton's lecture
- Lotus Notes Domino 8: Upgrader's Guide
- C++ Study Notes 1: HINSTANCE's nature
- Notes: CPU and Memory of O.S.
- notes of Charlotte's Web Chapter 1
- CF76F. Tourist
- Tourist Attractions
- Java基础总结
- getChildHtml in Magento(麦进斗)
- Android EditText设置只能输入数字和小数点
- 康得新在宝马、奥迪“大本营”建立研发中心
- 一文读懂监督学习、无监督学习、半监督学习、强化学习这四种深度学习方式
- [CF538C]Tourist's Notes
- 【深入Spring】——Bean
- python基础模块之-string
- static属性以及方法
- 阿里云机器学习技术分享1——图像识别之TensorFlow实现方法【视频+PPT】
- 线程-线程基础
- OFBIZ 搭建环境创建数据库的脚本模板
- dubbo-admin java.langIllegalAccessError 系统内部错误
- 关于easyui的comobox的系列问题