| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
"すぬけ君は N 匹の猫を飼っている。猫 i と猫 j の仲のよさは fi,j である。ある猫の幸福度は、その猫から距離 1 以内にいる猫との仲のよさの総和である。すぬけ君は、猫 1 から猫 N をこの順に一次元上に配置することにした。(猫 i の座標を xi とすると、xi は x1<x2<…<xN をみたす実数) 猫の幸福度の総和の最大値を求めよ。"
I can't translate this problem. Can anyone translate for me? Problems link: http://tdpc.contest.atcoder.jp/tasks/tdpc_cat
You are raising N cats numbered by integers from 1 to N. When i-th cat and j-th cat's distance is less than or equal to 1, both of their happiness increases by fi, j. You want to allocate all of the cats at an one-dimension line, and maximize the sum of each cat's happiness. You should notice that i-th cat should be at (i + 1)-th cat's left side. (1 ≤ i < N)
Sorry for the bad English, if you couldn't understand it, please give me a comment :)
Japanese is damned popular this week.