Codeforces - 随笔分类(第5页) - onlyblues

摘要：D. Neutral Tonality You are given an array

a

$a$ consisting of

n

$n$ integers, as well as an array

b

$b$ consisting of

m

$m$ integers. Let

LIS (c)

$\text{LIS}(c)$ den 阅读全文

posted @ 2023-11-10 10:02 onlyblues 阅读(9) 评论(0) 推荐(0) 编辑

G. wxhtzdy ORO Tree

摘要：G. wxhtzdy ORO Tree After (finally) qualifying for the IOI 2023, wxhtzdy was very happy, so he decided to do what most competitive programmers do: try 阅读全文

posted @ 2023-11-06 11:34 onlyblues 阅读(25) 评论(0) 推荐(0) 编辑

E1. Doremy's Drying Plan (Easy Version)

摘要：E1. Doremy's Drying Plan (Easy Version) The only differences between the two versions of this problem are the constraint on

k

$k$ , the time limit and th 阅读全文

posted @ 2023-11-05 21:56 onlyblues 阅读(65) 评论(0) 推荐(1) 编辑

D. XOR Construction

摘要：D. XOR Construction You are given

n - 1

$n-1$ integers

a_{1}, a_{2}, \dots, a_{n - 1}

$a_1, a_2, \dots, a_{n-1}$ . Your task is to construct an array

b_{1}, b_{2}, \dots, b_{n}

$b_1, b_2, \dots, b_n$ such that: ever 阅读全文

posted @ 2023-11-05 16:48 onlyblues 阅读(49) 评论(0) 推荐(0) 编辑

D. Counting Rhyme

摘要：D. Counting Rhyme You are given an array of integers

a_{1}, a_{2}, \dots, a_{n}

$a_1, a_2, \ldots, a_n$ . A pair of integers

(i, j)

$(i, j)$ , such that

1 \leq i < j \leq n

$1 \le i < j \le n$ , is called go 阅读全文

posted @ 2023-10-29 20:23 onlyblues 阅读(105) 评论(1) 推荐(1) 编辑

D. Doremy's Connecting Plan

摘要：D. Doremy's Connecting Plan Doremy lives in a country consisting of

n

$n$ cities numbered from

1

$1$ to

n

$n$ , with

a_{i}

$a_i$ people living in the

i

$i$ -th city. 阅读全文

posted @ 2023-10-29 19:37 onlyblues 阅读(49) 评论(0) 推荐(0) 编辑

E. Segment Sum

摘要：E. Segment Sum You are given two integers

l

$l$ and

r

$r$ (

l \leq r

$l \le r$ ). Your task is to calculate the sum of numbers from

l

$l$ to

r

$r$ (including

l

$l$ and

r

$r$ 阅读全文

posted @ 2023-10-25 20:47 onlyblues 阅读(20) 评论(0) 推荐(0) 编辑

E. Time Travel

摘要：E. Time Travel Berland is a country with ancient history, where roads were built and destroyed for centuries. It is known that there always were

n

$n$ c 阅读全文

posted @ 2023-10-24 18:40 onlyblues 阅读(83) 评论(0) 推荐(0) 编辑

D2. Dances (Hard Version)

摘要：D2. Dances (Hard Version) This is the hard version of the problem. The only difference is that in this version

m \leq 10^{9}

$m \leq 10^9$ . You are given two arrays 阅读全文

posted @ 2023-10-23 23:56 onlyblues 阅读(60) 评论(0) 推荐(0) 编辑

B. Raspberries

摘要：B. Raspberries You are given an array of integers

a_{1}, a_{2}, \dots, a_{n}

$a_1, a_2, \ldots, a_n$ and a number

k

$k$ (

2 \leq k \leq 5

$2 \leq k \leq 5$ ). In one operation, you can do the follo 阅读全文

posted @ 2023-10-23 19:34 onlyblues 阅读(14) 评论(0) 推荐(0) 编辑

C. Medium Design

摘要：C. Medium Design The array

a_{1}, a_{2}, \dots, a_{m}

$a_1, a_2, \ldots, a_m$ is initially filled with zeroes. You are given

n

$n$ pairwise distinct segments $1 \le l_i \le r_i \l 阅读全文

posted @ 2023-10-23 17:28 onlyblues 阅读(161) 评论(0) 推荐(0) 编辑

D. Professor Higashikata

摘要：D. Professor Higashikata Josuke is tired of his peaceful life in Morioh. Following in his nephew Jotaro's footsteps, he decides to study hard and beco 阅读全文

posted @ 2023-10-18 14:55 onlyblues 阅读(13) 评论(0) 推荐(0) 编辑

D. Monocarp and the Set

摘要：D. Monocarp and the Set Monocarp has

n

$n$ numbers

1, 2, \dots, n

$1, 2, \dots, n$ and a set (initially empty). He adds his numbers to this set

n

$n$ times in some order 阅读全文

posted @ 2023-10-17 16:48 onlyblues 阅读(29) 评论(0) 推荐(0) 编辑

G. Anya and the Mysterious String

摘要：G. Anya and the Mysterious String Anya received a string

s

$s$ of length

n

$n$ brought from Rome. The string

s

$s$ consists of lowercase Latin letters and a 阅读全文

posted @ 2023-10-14 14:51 onlyblues 阅读(99) 评论(0) 推荐(1) 编辑

C. Decreasing String

摘要：C. Decreasing String Recall that string

a

$a$ is lexicographically smaller than string

b

$b$ if

a

$a$ is a prefix of

b

$b$ (and

a \neq b

$a \ne b$ ), or there exists an 阅读全文

posted @ 2023-10-13 23:07 onlyblues 阅读(57) 评论(0) 推荐(0) 编辑

G. ABBC or BACB

摘要：G. ABBC or BACB You are given a string

s

$s$ made up of characters

A

$\texttt{A}$ and

B

$\texttt{B}$ . Initially you have no coins. You can perform two types 阅读全文

posted @ 2023-10-12 14:32 onlyblues 阅读(67) 评论(0) 推荐(0) 编辑

C. Card Game

摘要：C. Card Game There are

n

$n$ cards stacked in a deck. Initially,

a_{i}

$a_{i}$ is written on the

i

$i$ -th card from the top. The value written on a card does no 阅读全文

posted @ 2023-10-10 17:01 onlyblues 阅读(45) 评论(0) 推荐(0) 编辑

D. Sum of XOR Functions

摘要：D. Sum of XOR Functions You are given an array

a

$a$ of length

n

$n$ consisting of non-negative integers. You have to calculate the value of $\sum_{l=1}^{ 阅读全文

posted @ 2023-10-09 14:52 onlyblues 阅读(71) 评论(0) 推荐(0) 编辑

D. Effects of Anti Pimples

摘要：D. Effects of Anti Pimples Chaneka has an array

[a_{1}, a_{2}, \dots, a_{n}]

$[a_1,a_2,\ldots,a_n]$ . Initially, all elements are white. Chaneka will choose one or more different i 阅读全文

posted @ 2023-10-09 11:38 onlyblues 阅读(22) 评论(0) 推荐(0) 编辑

D. Prefix Purchase

摘要：D. Prefix Purchase You have an array

a

$a$ of size

n

$n$ , initially filled with zeros (

a_{1} = a_{2} = \dots = a_{n} = 0

$a_1 = a_2 = \ldots = a_n = 0$ ). You also have an array of integers 阅读全文

posted @ 2023-10-07 15:06 onlyblues 阅读(29) 评论(0) 推荐(0) 编辑

onlyblues

随笔分类 - Codeforces

公告

搜索

常用链接

随笔分类

随笔档案

阅读排行榜

推荐排行榜

最新评论