Dust_heart的博客

Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19051    Accepted Submission(s): 9517Problem DescriptionN个气球排成一排，从左到

SnacksTime Limit: 10000/5000 MS (Java/Others)    Memory Limit:65536/65536 K (Java/Others)Total Submission(s): 3282    Accepted Submission(s): 762Problem Description百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都...

2017 ACM-ICPC乌鲁木齐网络赛 G. Query on a string 【KMP+树状数组】You have two strings S and T in all capitals.Now anefficient program is requiredto maintain a operationand support a query.Theoperation C i ch withgiven integer iandcapital letter ch, changes the i-th

Codeforces 900C - Remove Extra One 【树状数组】You are given apermutation p of length n. Remove one element from permutation to make the number of records themaximum possible.We remind thatin a sequence of numbers a1, a2, ..., ak the element ai is a record if

Codeforces 920F - SUM and REPLACE【线段树】Let D(x) be the numberof positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by1 and 2), D(6) = 4 (6 is divisible by1, 2, 3 and 6).You are given an array a of n integers. Youhave to proce

Codeforces 914D - Bash and a Tough Math Puzzle 【线段树】Bash likesplaying with arrays. He has an array a1, a2, ... an of n integers. Helikes to guess the greatest common divisor (gcd) of different segments of thearray. Of course, sometimes the guess is not co

GT's DreamTime Limit: 2000/1000 MS(Java/Others)    Memory Limit: 256000/256000K (Java/Others)Problem Description在现实中认了无数师傅却毫无长进的GT在梦中成为了某武侠世界的神。在这个世界中初始有n个人，他们各成一派。作为世界神GT总共会进行m次操作，每次操作有如下两种情况1 x y表示x...

Codeforces 961E - Tufurama 【树状数组】Educational Codeforces Round 41 (Rated for Div. 2)One day Polycarp decided to rewatch his absolute favourite episode of well-known TV series "Tufurama". He was pretty surprised when he got results only for season 7 episod

Codeforces 620E - New Year Tree 【DFS序+线段树】 Educational Codeforces Round 6The New Year holidays are over, but Resha doesn't want to throw away the New Year tree. He invited his best friendsKerim and Gural to help him to redecorate the New Year tree.The N

Codeforces 833B - The Bakery 【DP+线段树】 Some time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which can bake several types of cakes, and opened the bakery.Soon the expenses started to overco

Codeforces 459D Pashmak and Parmida's problem【树状数组】 Parmida is a clever girl and she wants to participate inOlympiads this year. Of course she wants her partner to be clever too (although he's not)! Parmida has prepared the following test problem for Pash

Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4627    Accepted Submission(s): 1324Problem DescriptionRecentl

LCISTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7349    Accepted Submission(s): 3110Problem DescriptionGiven n integers.You

An easy problemTime Limit: 8000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1910    Accepted Submission(s): 822Problem DescriptionOne day, a us

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21320    Accepted Submission(s): 8789Problem DescriptionAt the entrance

Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8341    Accepted Submission(s): 3219Problem DescriptionDuring the Wa

C. Fountainstime limit per test2 secondsmemory limit per test256 megabytesArkady plays Gardenscapes a lot. Arkady wants to build two newfountains. There are n available fountains, fo

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19645    Accepted Submission(s): 11803Problem DescriptionT

POJ3468（线段树之区间更新）A Simple Problem with IntegersYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of

HDOJ 5592 ZYB's Premutation（逆序对变题：树状数组||线段树）ZYB  has a premutation P,buthe only remeber the reverse log of each prefix of the premutation,now he askyou to restore the premutation.Pair (i,j)(i<j)is considered as a reverse log if Ai>Ajis matched.

                                            Naive Operations                                Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 502768/502768 K (Java/Others)Problem Description...