f(x) = f(y)+f(x-y)+2y (1<=y<=x/2) f(1)=1
i know that f is about xlogx when y is x/2
but i cant prove xlogx is maximum
can someone help me? why cant it be bigger?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
f(x) = f(y)+f(x-y)+2y (1<=y<=x/2) f(1)=1
i know that f is about xlogx when y is x/2
but i cant prove xlogx is maximum
can someone help me? why cant it be bigger?
Can i determine whether the size of minimum vertex cover of general graph is less than 3 or not within 2 seconds where V,E <= 5* 10^4 ??
Thank you
here's example problems.
https://www.codechef.com/START21B/problems/MSUB121
https://atcoder.jp/contests/abc219/tasks/abc219_g
is there any tag or name for n*sqrt(n) problems? or are they just ad-hoc? i can't even approach to these type of problems during the contest. i wanna practice but i don't know what to search.
Q : is there any tag or category for type of problems above? or any tutorial blogs for those
There is simple undirected graph with n vertices and m edges. ( N<=10 , m<=n*(n-1)/2 ) At most how many edges can we pick so that in graph with n vertices and edges we picked, degree of every vertices is equal or less than P. ( P <= n-1 )
I know this problem is about bitmask dp but i cant figure out dp-state.
Is there any hint or similar problem in codeforces or atcoder?
Name |
---|