Codeforces 854B. Maxim Buys an Apartment 水题
来源:互联网 发布:java就业班学什么 编辑:程序博客网 时间:2024/05/16 13:07
题意
有一排n(1e9)个房子,已知里面有k个已经有人居住.剩余的为空.
询问最小和最大的情况下,一个房子为空但是紧邻着不为空房的个数.
解法
首先当k=0或者k=n时,ans=0.
最小时,所有有人居住的房子挤在一边,ans=1.
最大时,一个有人居住的房子最多在他周围产生两个满足条件的房子,且最少会有n-k个.
ans=min(2*k,n-k);
代码
/* LittleFall : Hello! */#include <bits/stdc++.h>using namespace std;int main(void){ int n,k; scanf("%d%d",&n,&k); if(k==0||k==n) printf("0 0\n"); else printf("%d %d\n",1,min(k*2,n-k) ); return 0;}
阅读全文
0 0
- Codeforces 854 B Maxim Buys an Apartment
- Codeforces 854B Maxim Buys an Apartment
- Codeforces 854B. Maxim Buys an Apartment 水题
- Codeforces 845 B. Maxim Buys an Apartment
- B. Maxim Buys an Apartment
- Codeforces Round #433 (2)B :Maxim Buys an Apartment
- Codeforces Round #433 Div. 2 B Maxim Buys an Apartment
- Codeforces Round #433 B.Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2)B. Maxim Buys an Apartment
- Codeforces Round#433 B. Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2) B. Maxim Buys an Apartment
- Codeforces Round #433 Div. 2 B. Maxim Buys an Apartment
- Codeforces Round #433 (Div.2 ) B. Maxim Buys an Apartment(水题)
- Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) B. Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2) B.Maxim Buys an Apartment(找规律+技巧)
- CF #433 DIV2 B. Maxim Buys an Apartment
- CF854B Maxim Buys an Apartment【思路】
- CodeForces 261B Maxim and Restaurant [数学+基础DP]
- 分段式显示Boss血条思路
- 窗口函数
- 电脑显示屏突然一半变色并且抖动
- sftp实现文件的下载
- Hybrid框架之交互通信篇
- Codeforces 854B. Maxim Buys an Apartment 水题
- AngularJS系列(九)——模块
- Warning
- 解决Android6.0以上ScrollView嵌套RecyclerView出现的RecyclerView高度不正常的问题
- 5秒钟跳转页面
- mysql Hash索引和BTree索引介绍
- 移动端适配以及百分比布局与rem比较
- 变量的解构赋值
- [SDUT](1138)数据结构上机测试2-1:单链表操作A ---链表操作(线性表)