"すぬけ君は 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
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
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.