Hello Codeforces — ers,

I have this problem need to solve

Given an array a with N integers (1 <= N <= 500000)

Given Q queries (1 <= Q <= 100000), for each query, we have 2 integers L and R, we have to find the maximum value of a[x] + a[y] + a[z] with sastifies:

. L <= x < y < z <= R . y — x < z — y

Thanks a lot :D

Hello everyone,

I'm looking forward to some problems in competitive programming which used some calculus techniques (derivatives, integrals, ....).

Would you please show me some problem :D :D :D ? The solution maybe just use only calculus, not using some hard techniques like FFT. Thanks a lot :D

Hello Codeforces,

My sister implemented the solution for 279B — Books here:

https://ideone.com/uPow6L

And so amazing !!!! This solution is accepted. I've tried but cannot create the test case to prove this solution is wrong. Can you help me ? Or can you prove that this solution is correct

Thank you a lot for your help.