Segment Tree Problems
Distinct Dishting You are given an array of N integers. Then there will be Q commands of the following type: Change ... |
A Unique Array An array is called "unique" if it has no consecutive element with same value(A[i] != A[i-1]). Given ... |
A Journey to Rupsha Tomorrow, April 14th, 2019 is a special day. Guess why. Bengali New Year? Your guess was partially c... |
Taju Kage Bunshin No Jutsu Naruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses... |
Count the Chaos Imagine, you have an array of integers of size N. At each index of this array is a unique integer fr... |
Crayons Five friends A, B, C, D and E has come to a shop to buy crayons for their art project. They need cra... |
Superman and the Buildings of Dahaka To end the long-running feud between Superman and Goku fans regarding who's stronger, Zeron has deci... |
Palindrome Query I You are given a string of length L. You have Q queries. In each query, you will be asked to either u... |
Rivalry Friends Ryo and his girlfriend love to think about challenges. One day his girlfriend gave him a challenge t... |
Answer the Queries Given an array of N elements, indexed from 0 to N−1. Now you are given some queries in the form [L,R... |
Birthday of Aliens On the planet of Royal Royal, a university named Royal University of Engineering and Technology exis... |
No Onion, No Cry -Onions make us cry, don't they? They can make us happy too. -How? -Read the statement carefully! I... |
Welcome to Criterion Rounds The team congratulates you for participating in this contest and for being part of the journey towar... |
Straightforward No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen... |
Easy Prime! There are N numbers in an array. You will have Q queries. In each query, you can make 2 operations. ... |
Itachi's Challenge Sasuke is a 12-year old ninja who is very much interested in learning Ninjutsu (A tactic used by nin... |
Just Another Range Query This is another simple range query problem where you will perform some updates and answer some queri... |
Another Query on String You are given a string S (of length n) consisting of alphabets only. You need to perform m queries o... |
Jumping Frog (II) A frog wants to cross a river. There are some posts in the river. The frog can go from one post to a... |
Palindrome and Queries You'll be given an array A of N strings containing lowercase English letters only and Q queries. In ... |
Maximum Meetings I am the boss of my company. I have n employees. The office time of my company starts at 1. Every em... |
Donate Our Department We are students of CSE, IU. It is very well known that our departmental instruments are not so good.... |
Stick Game Shahwat has a stick that has n blocks that are indexed from 1 to n (from first to last). Each block ... |
Bored?? "Avoid touching your face, particularly your eyes, nose or mouth to prevent the virus from entering ... |
Paltu, a Prime Lover Note that the memory limit is unusual. Paltu is a good programmer and he loves prime numbers. One da... |
Other Categories
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
