zf_v5的博客

p????️ > p ???? > p ???? g + s + b <= n / 2 g < s , g < b maximize g + s + b 尽可能使金牌最少(多个答案输出一种) : a[1] #include <iostream> #include <cstring> #include <ctime> #include <algorithm> using namespace std; int p[400100],t,

Numbers 1,2,3…n(each integer from 1 to n once) are written on a board. In one operation you can erase any two numbers a and bfrom the board and write one integer a+b2 \frac {a+b}{2} 2a+b​ rounded up instead. You should perform the given operation n - 1 tim