Can someone help me with this problem http://www.spoj.pl/problems/HIST2 ?
I know how to solve the maximum perimeter, but how can I count the number of permutations?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.04.2026 03:34:45 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
Look at the constraints. N <= 15 is shouting bitmasks.
Generally speaking, if a state S can be reached from the states A1,A2,A3....AK, and the function G(state) is the number of ways to generate the state. We have that:
G(S) = G(A1)+G(A2)+G(A3)....+G(AK)
Hope it helps.
You mean to do a function to calculate maximum and another one that count the permutations?
I try to code that problem ... here's my code ... http://pastebin.com/MKUZA75W ... but it doesn't count properly the permutations ... :(
I am getting TLE in this question . Did you solve it ? I used dp+ bitmask . Here is the link for code : http://ideone.com/vnLa8S Can you tell how to optimise it .