Codeforces Round 752 (Div. 2)

Solutions for Codeforces Round 752 (Div. 2) (contest 1604). 1/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 752 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1100 | Time: 2m 59s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Era	800	greedy	1m 45s	✗
B	XOR Specia-LIS-t	1100	-	1m 14s	✓

Practice › Codeforces Solutions › Codeforces Round 752 (Div. 2) ›

CF 1604A - Era

We are given a sequence of integers, and we can insert any positive integer anywhere in the sequence as many times as we like. The goal is to make the sequence satisfy the condition that each element at position i is at most i.

Practice › Codeforces Solutions › Codeforces Round 752 (Div. 2) ›

CF 1604B - XOR Specia-LIS-t

We are given a sequence of integers and are allowed to split it into consecutive subarrays. For each subarray, we compute the length of its longest increasing subsequence (LIS).