Hello,
It's from Innopolis Open, Final Round, 2015-2016, the problem A. I can't approach it, can somebody give me a hint?
Have nice day,
# | 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 |
Hello,
It's from Innopolis Open, Final Round, 2015-2016, the problem A. I can't approach it, can somebody give me a hint?
Have nice day,
Name |
---|
When the left end of the segment (segment of length L) moves between coordinate x0 and x0 + 1 (x0 is integer), the covered area changes as a linear function. The sum/difference of slopes is enough to say how it changes.
You should sweep over the given points, updating something when the sweep is over some point or some point is L to the right from the sweep line. This way you will know the area for any placement you want.