Could anyone give me some ideas for these problems??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Could anyone give me some ideas for these problems??
Can anyone tell me any online Judge like pc^2?? ... I want to set a contest with my inputs and outputs.
Hello everybody, help with this proof please: proof
The writer say I have to proof this:
|A1 + Aj - M | + |A2n + Ai - M| <= | A1 + A2n - M | + | Aj + Ai - M |
but for me is:
| A1 + Aj - M | + |A2n + Ai - M | >= | A1 + A2n - M | + | Aj + Ai - M |
then I reduced that:
| A1 + Aj - M | + A2n + Ai - M >= A1 + A2n - M + | Aj + Ai - M |
| A1 + Aj - M | + Ai >= A1 + | Aj + Ai - M |
then if A1 + Aj - M >= 0, so Aj + Ai - M >= 0 too, so we have:
A1 + Aj - M + Ai >= A1 + Aj + Ai - M, wich is correct.
but if A1 + Aj - M < 0, we have to make two cases
if Aj + Ai - M < 0, we have :
M - A1 - Aj + Ai >= A1 + M - Aj - Ai
Ai >= A1, which is correct
but if Aj + Ai - M >= 0, we have :
M - A1 - Aj + Ai >= A1 + Aj + Ai - M
M >= A1 + Aj, wich is not always true.
I don't know how to finish this proof, maybe for any condition is not necesary to solve this last case or I was wrong in some case.
For a better understanding this is the problem: problem:
Name |
---|