Please subscribe to the official Codeforces channel in Telegram via the link ×

Help on a problem

Revision en1, by Medeali, 2024-05-17 13:25:52

I am trying to solve this problem but i keep getting WA. Here is my code My idea is for eacch query (l,r) answer the query for (l,n) and then for (r,n) without including r in the second one and then the answer would be difference Now for (l,n) i sort queries in terms of increasing l and at each point i keep updating occurences and sum occurences of elements greater than k using segment tree. For (r,n) same thing but i sort in terms of increasing r. Could someone help me spot the issue with my code.


  Rev. Lang. By When Δ Comment
en1 English Medeali 2024-05-17 13:25:52 590 Initial revision (published)