Hey thanks a lot for the approach :)

lol okay

Thanks a lot!

"/

too costly since there are queries for it, anyways thanks :)

oh okay thanks

I was solving a similar problem...just wondered if this is a new problem. It has no source..just asking for gaining for about this range..query topic :)

Find you many times in comment section helping, so asked you. There's no constraint..its just a discussion problem merely for gaining knowledge :)

tfg can you comment?

Much appreciated , please share your approach :) Sahilamin219

Can anyone help me with this problem

Thats correct. Still that gives TLE on test 28

Thanks harsh, great explanation in the given link.

This is my Submission 77023902 , its easy to understand. Problem : 1225D - Power Products

That would be okay to me. Just need to make unordered_map instead of map

For question D My logic: keep on getting index with minimum prefix sum till now, in order to have those indices with minimum effect in my answer using a priority_queue? I get WA on test case 7. Can you tell me why am i wrong? Can't find a test case for it. Any help is much appreciated. Thanks a lot Problem 1175D - Array Splitting My submission : 77223612

Using map<vector,int> mp; gives me TLE.

I want to use Unordered_map to avoid TLE.

How can i make it? Any help is appreciated. Thanks.

Question : 1225D - Power Products

My Submission : 77023902

neal Please help

Thanks How does it work? Can you give me a little tutorial please on its working? THat would be great and much appreciatd.

Obviously they were solved by some other observations where we didn't need it, but i felt that bruteforce kindof thing would work if i had primes upto 10^9

Right Thanks

Exactly! I just pray that i get AC in greedy problems and generally fail to Prove that why my solution was right! Thanks a lot Enchom

I feel you have written exactly what happens. Proving that our intuition is right is somewhere i lag. I'll definitely keep this in mind to read editorials in order to learn how to prove! Thanks a lot tfg

Woaah!! That is so so great! Thanks Man!!

Hi Thanks for the perfect solution i was looking for. Thanks alot :)

Anyone who has done D using DP ? Please share your solution

Problem : E My submission : 74555362 Verdict: WA on TC 56 Can anyone tell what is the mistake? I cant figure it out. Used the same method as told in Editorial. My code is very short. Thanks a lot :)

Anyone who has done D using DP ? Please share your solution

Thanks a lot CoderPenguin Got AC with you method with ease.

Auto comment: topic has been updated by omggg (previous revision, new revision, compare).

Your solution is easy to understand. So we basically do greedy thing and keep on generating biggest possible substring. I got it. How to analyse time complexity of such algorithm? Since there can me all different alphabets or maybe duplicates? Till what N , it won't face TLE?

There's hard version of this question as well. How to deal with it? https://mirror.codeforces.com/contest/1183/problem/H

Thanks a lot malfple Great explanation! Thumbs Up

THenks

THanks :)

Thenks yeputons. Was looking for something like this only

Thanks Pavan :)

Never mind, i found it.

DIV 1 E Can anyone please point out the mistake? Getting WA for test case 2.

My code : #here8461366

Reference code: here

THankyou very much

Okay i have got it.

DIV 1 E n74: maximum non-increasing subsequence in range. Why do we need this?