08 2018 档案

Codeforce 1004C
摘要：Description Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers. Sonya has drawn nn number 阅读全文
posted @ 2018-08-10 20:09 左手边五十米 阅读(254) 评论(0) 推荐(0)
Monthly Expense（二分--最小化最大值）
摘要：Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the 阅读全文
posted @ 2018-08-05 19:33 左手边五十米 阅读(233) 评论(0) 推荐(0)
Codeforces Round #499 (Div. 2)（1011）
摘要：Natasha is planning an expedition to Mars for nn people. One of the important tasks is to provide food for each participant. The warehouse has mm dail 阅读全文
posted @ 2018-08-05 14:17 左手边五十米 阅读(178) 评论(0) 推荐(0)
Educational Codeforces Round 45 (Rated for Div. 2)
摘要：A bracket sequence is a string containing only characters "(" and ")". A bracket sequence is a string containing only characters "(" and ")". A regula 阅读全文
posted @ 2018-08-05 14:06 左手边五十米 阅读(207) 评论(0) 推荐(0)
Closest Common Ancestors
摘要：Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ances 阅读全文
posted @ 2018-08-04 09:52 左手边五十米 阅读(257) 评论(0) 推荐(0)
Codeforces Round #498 (Div. 3)
摘要：You are given an array d1,d2,…,dnd1,d2,…,dn consisting of nn integer numbers. Your task is to split this array into three parts (some of which may be 阅读全文
posted @ 2018-08-04 09:44 左手边五十米 阅读(204) 评论(0) 推荐(0)
Cows
摘要：Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his 阅读全文
posted @ 2018-08-02 21:03 左手边五十米 阅读(498) 评论(0) 推荐(0)
Stars(树状数组单点更新）
摘要：Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star 阅读全文
posted @ 2018-08-02 20:44 左手边五十米 阅读(407) 评论(0) 推荐(0)
线段树模板(单点更新）
摘要：1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include<iostream> 5 #include<algorithm> 6 using namespace std; 7 const int MAXN=2e5+10; 8 阅读全文
posted @ 2018-08-02 20:27 左手边五十米 阅读(187) 评论(0) 推荐(0)
Color the ball (线段树的区间更新问题）
摘要：N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色吗？ Input每个测试 阅读全文
posted @ 2018-08-02 20:25 左手边五十米 阅读(201) 评论(0) 推荐(0)
Just a Hook(树状数组)
摘要：In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic 阅读全文
posted @ 2018-08-02 20:16 左手边五十米 阅读(402) 评论(1) 推荐(0)