![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CodeForces
Adolphrocs
这个作者很懒,什么都没留下…
展开
-
A - Diplomas and Certificates CodeForces - 818A
Discription There are n students who have taken part in an olympiad. Now it's time to award the students. Some of them will receive diplomas, some wiil get certificates, and others won't receive any...原创 2018-11-12 07:35:43 · 158 阅读 · 0 评论 -
Permutation Game CodeForces - 818B
Description n children are standing in a circle and playing a game. Children's numbers in clockwise order form a permutation a1, a2, ..., an of length n. It is an integer sequence such that each inte...原创 2018-11-12 07:40:39 · 260 阅读 · 0 评论 -
E Boredom Codeforce 离线+树状数组
Problem Ilya is sitting in a waiting area of Metropolis airport and is bored of looking at time table that shows again and again that his plane is delayed. So he took out a sheet of paper an...原创 2019-04-15 21:32:00 · 252 阅读 · 0 评论 -
CodeForces - 861D D. Polycarp's phone book STL map套set
problem There arenphone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from0. All the numbers are distinct. There is the l...原创 2019-04-23 22:37:05 · 181 阅读 · 0 评论 -
[Codeforces 242.E] XOR on Segment(线段树)
E. XOR on Segment time limit per test:4 seconds memory limit per test:256 megabytes input:standard input output:standard output You’ve got an arrayaa, consisting ofnnintegersa1,a2,…,an. You are ...原创 2019-09-18 21:46:36 · 322 阅读 · 0 评论 -
CEOI2019 / CodeForces 1192B. Dynamic Diameter
题意:给出一个带权树,每次修改树上一条边的权值,询问树的直径 题解:https://www.cnblogs.com/TinyWong/p/11260601.html线段树维护全DFS序 #include <bits/stdc++.h> #define FOR(i,s,t) for(int i=(s);i<=(t);i++) #define ROF(i,s,t) for(in...原创 2019-09-22 17:28:06 · 381 阅读 · 0 评论