CodeForces 580D.Kefa and Dishes(状压DP）
D. Kefa and Dishes
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There were n dishes. Kefa knows that he needs exactly m dishes. But at that, he doesn’t want to order the same dish twice to taste as many dishes as possible.
Kefa knows that the i-th dish gives him ai units of satisfaction. But some dishes do not go well together and some dishes go very well together. Kefa set to himself k rules of eating food of the following type — if he eats dish x exactly before dish y (there should be no other dishes between x and y), then his satisfaction level raises by c.
Of course, our parrot wants to get some maximal possible satisfaction from going to the restaurant. Help him in this hard task!
Input
The first line of the input contains thr
以你之姓@
柔情只为你懂
ゞ 浴缸里的玫瑰
迷南。
傷城~
还没有评论，来说两句吧...