Comments
+20

Maybe lack of problem proposal is one of the reason. Second reason maybe the cost of contest that is roughly INR 4-5 Lakh which in Codeforces is in some thousands. I don't think the money might be the great factor but ya it can be one of the reason, lack of problem proposal remains at first
+74

I was not aware that contest is extended by 15 mins. I closed my laptop and after 2 mins later I realised it's been extended.

As many new features have been added in Chef (copying sample input) please also make a pop up feature for any announcement.
0

Observe that After performing a minimum number of steps each element of array will be equal to the gcd of the array.

I used a segment tree with binary search. Note that gcd never increases, So suppose if I am finding the minimum number of operations that are required to make this element equal to gcd, then I can do a binary search on range $$$[i,n]$$$. If we are unable to make the element equal to gcd then do a binary search in the range $$$[1,i-1]$$$

Our answer is equal to the maximum operations that any element needs.
+9

Good Luck !!
+1

Ah! That's not my Handle

On _Enigma_11 → Magic, 5 years ago
+12

Let me tell you more:

1) I am also testing more rounds on Codeforces. 2) Also I am an Editorialist for the upcoming January Cookoff. 3) Also I practiced the questions of above my level more. 4) You can watch my resume for more of my accomplishments.
0

I did Binary Search and used Difference Array.

+23

Same here!! And I can say after the contest everyone will love zebra.
+274

Today is my Birthday and I enjoyed testing this amazing round on my birthday. Problems are very very interesting. (May I get my gift now, you know what I want)
+137

And I am testing the rounds without asking for you know what I want.
-16

I remember a time when I was stuck in a question in Codechef Long Challenge. This blog is really gonna help all.
On 055D → Codeforces Round #665 (Div. 2), 6 years ago
+127

As a Tester, I would like to say that the problems are really interesting, also the statements are short too. Please upvote me now! :)
-7

Apology for the delay I will be posting it in few hours.

Update: Posted
+4

Reminder: Contest starts in 15 minutes.
0

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

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

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

So excited to see Indian Round in Codeforces
0

I calculated prefix sum as well as suffix sum. Since array was immutable, so I created sparse table for array,prefix array and suffix array.

Then for each Index i, find the maximum subarray range that can be formed by applying binary search on sparse table of given array. After that find the maximum suffix sum in left part and maximum prefix sum in right side of that index. If the sum are positive add them.

Here is my solution for the above approach Solution
On Sulfox → Codeforces Round #635, 6 years ago
0

I hope I am able to help as many as characters as I can. Sulfox hoping for good and interesting problems. And Thanks for providing Yet Another Chinese Round.