Comments

Has anyone solved F with a binary search(n log(n))?

Problem A: a + b.

max(pref_mx — mn( mn after pref_mx ))

answer mx_pref

author of D pranker ):

Is there anyone who decided F using random_shuffle?

You can try to write some problems about binary search, it's can help you

Where can I have a mistake?:

Problem F — Wrong answer on test 36.

But it works:

Problem F — Accepted.

On tourist → Codeforces Round #850, 4 years ago
0

Cool round!))