FRANS4X

分类

Alg(22) CF(5) Leetcode(1) OS ucore(8) tracker(1) ucore Lab(1) 未归档(27)

/ 注册

全部文章（共65篇）

codeforces Round #610 E - The Cake Is a Lie

codeforces Round #610 E - The Cake Is a Lie 题目： https://codeforces.com/contest/1282/problem/E We are committed to the well being of all participant...

2020-11-21

0 444

Codeforces Round #612 (Div. 2) C. Garland

Codeforces Round #612 (Div. 2) C. Garland Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n lig...

2020-11-21

0 518

codeforces Hello 2020 - E. New Year and Castle Construction

codeforces Hello 2020 - E. New Year and Castle Construction (待补) Kiwon’s favorite video game is now holding a new year event to motivate the users! ...

2020-11-21

0 457

codeforces Hello 2020 D. New Year and Conference

codeforces Hello 2020 D. New Year and Conference （还没理解）题意： Filled with optimism, Hyunuk will host a conference about how great this new year wil...

2020-11-21

0 485

Educational Codeforces Round 80 题解

Educational Codeforces Round 80 比赛链接： Educational Codeforces Round 80 A-Deadline 由 $ x + \frac{d}{x + 1} = (x + 1) + \frac{d}{(x + 1)} - 1$ ， f (...

2020-11-21

0 484

Codeforces Round #615（Div.3）

Codeforces Round #615（Div.3） A. Collecting Coins 注意(n)可能不够用的情况。 #include<bits/stdc++.h> using namespace std; #define ll long long const int m...

2020-11-21

0 398

Educational Codeforces Round 81 题解

Educational Codeforces Round 81 题解 A - Display The Number 肯定是1越多越好，因为位数越大越大，所以当n是2的倍数的时候，全是1 但是n可能不是n的倍数，此时应该有$（ n - 3 ） / 2 $个 1 1 1和 1 1 1个 7 7 7...

2020-11-21

0 462

CF Round #620 E [1-Trees and Queries]

CF Round #620 E 1-Trees and Queries 题意：给你一颗树，进行 q q q次查询，每次查询时在树上加一条边，然后问此时两点间的距离能否为一个特定的值 k k k，（能反复经过同一个节点或同一条边）。基本思路：加了一条边连接了x，y以后，a，b两点间的距离就...

2020-11-21

0 506

Codeforces Round #622 C2 - Skyscrapers

Codeforces Round #622 C2 - Skyscrapers(单调栈) 题意：给一个整数 n n n以及一个数组 m m m。构建一个数组 a a a满足： 1 ≤ a i ≤ m i 1≤a_i≤m_i 1≤ai≤mi，且不存在这样的情况 j < i < k...

2020-11-21

0 521

codeforces1312 D. Count the Arrays

codeforces1312 D. Count the Arrays 题目大意：给定 n , m ， n, m， n,m，在$1 ~ m $中取 n n n 个元素，有且只有两个元素相同，将它们排成在最大值左侧严格单增，在最大值右侧严格单减的序列。问这样的序列有多少个？答案对 9982443...

2020-11-21

0 472