Wouldn't it be good if we have a Report Option to directly report plagiarized codes without having to create new blog/ comment on old blogs?

Many users nowadays are creating new accounts to report them through blogs. This can be avoided if we have a way to anonymously report cheaters without having to create blogs.

I think this feature will be helpful as some people who cheat are able to bypass MOSS undetected by using various methods. So if we ever come across such codes we can directly report them for checking.

MikeMirzayanov , please consider this.

I checked one of my previous comments and found that the reply on that comment was missing.

I checked the profile of the guy who had replied and it still exists. I am sure that there was a reply on my comment but it isn't present anymore. I mean the profile is there but the reply isn't.

So is there any way to delete comments on blogs?

I would like to know if there's any blog/article which lists all the DS and Algos required to be on a specific rank. I mean , For example, newbie ranked coders need not learn things like segment tree or sqrt decomposition, but should work on their basic implementation skills.

Similarly I want to know what are the things , coders from each category are expected to know ?

I had found this article but it just gives an overall summary... https://www.hackerearth.com/getstarted-competitive-programming/

PS: I want to know this because I feel like it will help me have a proper step-by-step approach to practice CP.

Problem link : https://codeforces.com/problemset/problem/478/D

The editorials says that the max height is independent of the colors of the block and can be calculated directly through the total number of blocks.

I am not able to prove it. I need mathemetical/analytical proof of this.

Can anyone help please?

Original Question Statement Link : https://pastebin.com/4jH5GJqk (test cases included )

The Question basically asks ,

Given $$$K$$$ Binary Trees each rooted at it's node 1.

We can traverse normally inside a tree.

And we can also move from $$$i_{th}$$$ tree to $$$(i+1)_{th}$$$ or $$$(i-1)_{th}$$$ tree through the root nodes of both i.e go from root node of one tree to the root node next or previous tree.

We can also move from the $$$0_{th}$$$ tree to the $$$(K-1)_{th}$$$ tree and vice versa.

$$$N_i$$$ denotes the number of nodes in the $$$i_{th}$$$ tree.

Find the number of edges in the longest simple path (each node is visited once) over the entire forest of trees.

Note: if we move from $$$i_{th}$$$ tree to $$$(i+1)_{th}$$$ tree via root, we have to increase the answer by 1 as if we have an edge between both the roots,

$$$3 \leq K \leq 10^5$$$

$$$1 \leq N_i \leq 10^5$$$

$$$3 \leq \sum_{i=0}^{K-1} N_i \leq 2,000,000$$$

Time Limit : 1 Sec

I can't think of any approach to solve this. Can anyone please help me?