Codeforces Round #433 (Div. 2) B.Maxim Buys an Apartment(找规律+技巧)

最新推荐文章于 2020-03-11 10:51:34 发布
最新推荐文章于 2020-03-11 10:51:34 发布
阅读量380 收藏
点赞数
分类专栏： ACM__水题 文章标签： 规律
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_38538733/article/details/77877668
版权
Maxim在Metropolis的Line Avenue买公寓，目标是有已住邻居的可售公寓。给定n个公寓和k个已住公寓，找出对Maxim来说好的公寓数量的最小值和最大值。输入为n和k，输出最小和最大可能的好数量。样例中，1,2,3号公寓住人时，只有4号公寓合适；1,3,5号公寓住人时，2,4,6号公寓都合适。" 112205601,7836804,Tomcat Session管理：线程安全与生命周期,"['Java', '架构', 'tomcat', '线程安全']
摘要由CSDN通过智能技术生成

Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be inhabited, others are available for sale.

Maxim often visits his neighbors, so apartment is good for him if it is available for sale and there is at least one already inhabited apartment adjacen

最低0.47元/天 解锁文章
wust_zwl
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) B. Maxim Buys an Apartment
shyoldman的博客
09-07 392
B. Maxim Buys an Apartment time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Maxim wants to buy an apartment i
#433 - B. Maxim Buys an Apartment
无知而狂妄
09-14 301
题目连接：http://codeforces.com/contest/854/problem/B题目描述DescriptionMaxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and
Codeforces Round #433 （2）B :Maxim Buys an Apartment
ZJLORD
09-07 665
Maxim Buys an Apartment Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apart
CF854B Maxim Buys an Apartment【思路】
狂奔的蜗牛
09-08 375
题意：n个房子，有k个已经住人了，一个人去买房，他喜欢隔壁已经有人的房子，问这样的房子最少、最多有几个 思路：最少的很好想，最多的考虑给每个k分配一些房子，k==0，特判 n/k ≥ 3，每个k两边都有能买的房，2 * k n/k == 2，考虑余数，k + n % k n/k == 1，没人住的房子不到一半，塞中间，n - k #include #include #
Codeforces Round #433 (Div.2 ) B. Maxim Buys an Apartment（水题）
HJY
09-07 625
Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be
Maxim Buys an Apartment 【CodeForces 854B】
快速乘与快速幂
08-19 116
以三个为一组，如6个房间，2个人占用时，这样放可以有最大的选择；0 1 0 0 1 0； #include<cstdio> #include<cstring> #include<cstdlib> #include<iostream> #include<cmath> #include<queue> #include<alg...
Codeforces-854B - Maxim Buys an Apartment - 贪心
LucienShui
09-07 931
链接:  http://codeforces.com/contest/854/problem/B题目：Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged
Codeforces 854B. Maxim Buys an Apartment 水题
秋叶红于二月花
09-08 398
题意 有一排n(1e9)个房子,已知里面有k个已经有人居住.剩余的为空. 询问最小和最大的情况下,一个房子为空但是紧邻着不为空房的个数.
B. Maxim Buys an Apartment
weixin_30391339的博客
09-09 77
B. Maxim Buys an Apartment time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Maxim wants to buy an apartment in ...
CodeForces 854B－－－ Maxim Buys an Apartment
qq_44462976的博客
08-19 184
题目CodeForces 854B Maxim Buys an Apartment Time Limit:1000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 854B use MathJax to parse formulas Descrip...
Codeforces 854 B Maxim Buys an Apartment
不要錯過才珍惜
09-06 490
题目地址 题意：告诉你一个小区，里面有n间房子，只有有邻居的房子才能是好房子，现在告诉你有m间房子卖出去了，但是不知道房子的位置。让你求出好房子的最大数量和最小数量。 思路：最好的情况只有当n - m > m * 2时他才可能会有房子不是好房子（看下图），如果小于的话那剩下的房子都是好房子。最坏的情况就是全部靠边站，那就是1了。有两种情况需要特判，应该是房子全部卖出去了（n==m）或者没有房子卖
Codeforces--854B--Maxim Buys an Apartment
猩猩是个好程序员的博客
03-11 139
题目描述： Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apartments are adjacent if th...
854B - Maxim Buys an Apartment
weixin_34081595的博客
03-12 172
B. Maxim Buys an Apartment time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Maxim wants to buy an apartment in a new ...
codeforces 443 B.Table Tennis
风的记忆
10-27 1144
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins k ga
codeforces 231C To Add or Not to Add （脑洞题）
风的记忆
07-14 849
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array. However, before looking for such number, you are allowed to perform not more than k following operations
codeforces 442 A. Alex and broken contest（水题）
风的记忆
10-24 705
outputstandard output One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems. But there are too many problems, to do it manually. Ale
Codeforces Round #433 (Div. 2) A.Fraction（暴力）
风的记忆
09-07 610
Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator is smaller than its denominator (a < b) and that the fraction is called irreducible if its numerator and it
codeforces 279C Ladder（数据技巧）
风的记忆
07-14 556
You've got an array, consisting of n integers a1, a2, ..., an. Also, you've got m queries, the i-th query is described by two integers li, ri. Numbers li, ri define a subsegment of the original array, that is, the sequence of numbers ali, ali + 1, ali + 2,
codeforces round #792 (div. 1 + div. 2)
最新发布
06-06
codeforces round #792 (div. 1 + div. 2) 是 Codeforces 竞赛平台上的一场比赛，包括两个级别：div. 1 和 div. 2。这场比赛通常会有多个问题需要参赛者解决，每个问题都有不同的难度等级。参赛者需要在规定的时间内...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值