![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces
路明非hero
Coding Changes the World
展开
-
Codeforces Round #624 (Div. 3) F - Moving Points(离散化+树状数组)
F. Moving Points time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n points on a coordinate axis OX. The i-th point is located at the ...原创 2020-02-25 15:56:57 · 162 阅读 · 0 评论 -
递归亦或题,D题,D - Dr. Evil Underscores
D. Dr. Evil Underscores Today, as a friendship gift, Bakry gave Badawy n integers a1,a2,…,an and challenged him to choose an integer X such that the value max1≤i≤n(ai⊕X) is minimum possible, where ⊕ d...原创 2020-01-13 23:06:25 · 216 阅读 · 0 评论 -
Codeforces Round #576 (Div. 2) A-City Day B. Greenhouse Effect C-MP3 D- Welfare State
Codeforces Round #576 (Div. 2)A-City Day(模拟) https://codeforces.com/contest/1199/problem/A 题干:给你n个数,同时给你一个x和一个y,问这n个数中哪个数的前面有x个数比他大并且这个数的后面还有y个数比他小,如果都不符合条件则输出n这个值。 解题思路: ...原创 2019-08-01 20:31:46 · 205 阅读 · 0 评论