Processing math: 0%

随笔分类 -  思维

摘要:链接:https://ac.nowcoder.com/acm/contest/634/B 来源:牛客网 题目描述 给出n条线段,第i条线段的长度为a_i,每次可以从第i条线段的j位置跳到第i + 1条线段的j+1位置。如果第i+1条线段长度不到j+1,那么就会回到第$ 阅读全文
posted @ 2019-09-17 15:52 友人-A 阅读(139) 评论(0) 推荐(0) 编辑
摘要:B. Maximum of Maximums of Minimums You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into 阅读全文
posted @ 2019-08-18 16:36 友人-A 阅读(360) 评论(0) 推荐(0) 编辑
摘要:A. Odds and Ends A. Odds and Ends Where do odds begin, and where do they end? Where does hope emerge, and will they ever break? Given an integer seque 阅读全文
posted @ 2019-08-18 16:24 友人-A 阅读(266) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示