上一页 1 ··· 77 78 79 80 81 82 83 84 85 ··· 97 下一页
摘要: 【题目描述】 CE数码公司开发了一种名为自动涂色机(APM)的产品。它能用预定的颜色给一块由不同尺寸且互不覆盖的矩形构成的平板涂色。 为了涂色,APM需要使用一组刷子。每个刷子涂一种不同的颜色C。APM拿起一把有颜色C的刷子,并给所有颜色为C且符合下面... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(39) 评论(0) 推荐(0)
摘要: Problem Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farm... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(17) 评论(0) 推荐(0)
摘要: 题目描述 每天,农夫 John 的N(1 #include#include#include#include#include#include#include#include#include#include#include#include#include#i... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(25) 评论(0) 推荐(0)
摘要: Problem Description Valera has n counters numbered from 1 to n. Some of them are connected by wires, and each of the counters h... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(41) 评论(0) 推荐(0)
摘要: Problem Description The black king is standing on a chess field consisting of 109 rows and 109 columns. We will consider the ro... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(0) 评论(0) 推荐(0)
摘要: Problem Description This problem is the most boring one you've ever seen. Given a sequence of integers a1, a2, ..., an and a n... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(18) 评论(0) 推荐(0)
摘要: Problem Description A sequence of non-negative integers a1, a2, ..., an of length n is called a wool sequence if and only if th... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(38) 评论(0) 推荐(0)
摘要: 模型1:区间加法,单点询问 问题:给出一个长为 n 的数列,以及 n 个操作,操作涉及区间加法,单点查值。 对每个块设置一个加法标记,记录这个块中元素一共加了多少,每次操作对整块直接 O(1) 标记,而不完整块元素较少,暴力修改元素的值即可,每次询问时返回元素... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(317) 评论(0) 推荐(0)
摘要: Problem Description In the autumn of this year, two Russian teams came into the group stage of the most prestigious football cl... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(0) 评论(0) 推荐(0)
摘要: Problem Description Overall there are m actors in Berland. Each actor has a personal identifier — an integer from 1 to m (disti... 阅读全文
posted @ 2022-09-20 22:52 老程序员111 阅读(91) 评论(0) 推荐(0)
上一页 1 ··· 77 78 79 80 81 82 83 84 85 ··· 97 下一页