【JOISC 2020】D1T1 building4

题面及数据范围

The Olympic Games will be held in JOI Kingdom soon. In order to welcome participants from all over the world, the buildings on the way from the airport to the accommodation will be decorated. There are 2 N 2N 2N buildings, numbered from 1 1 1 to 2 N 2N 2N from the airport.
President K is in charge of the decoration project. He asked the public to make decoration plans. After examining them, he finally chose two plans, the plan A and the plan B. In the plan A, the luxury level of the building i i i ( 1 ⩽ i ⩽ 2 N 1 \leqslant i \leqslant 2N 1i2N) is A i A_i Ai. In the plan B, the luxury level of the building i i i ( 1 ⩽ i ⩽ 2 N 1 \leqslant i \leqslant 2N 1i2N) is B i B_i Bi.
Both plans are very good, and it is difficult to choose one of them. He decided to decorate the buildings in the following way: for each building, one of the plan A or B will be chosen. In order to decorate the buildings in a fair way, the plan A will be chosen for N buildings, and the plan B will be chosen for the remaining N buildings.
Moreover, since the participants will be excited if the luxury levels are increasing on the way from the airport to the accommodation, the following condition should be satisfied: C i ⩽ C i + 1 C_i \leqslant C_{i+1} CiCi+1for every i i i with 1 ⩽ i ⩽ 2 N − 1 1 \leqslant i \leqslant 2N - 1 1i2N1, where C i

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值