OJ Board

Hi!

I had no idea how to solve this problem efficiently....
I used DFS to solve this problem, but it seemed that my program ran too slow....

Can anyone help me to solve this problem efficiently ?

Thanks in advance!

Did you handle the case that the straight could be as follows?

AH 2S JH QH KD

Hmmm ....

I was wondering how to solve this problem.

First, I try to solve this problem like a 0/1 knapsack problem.

However, after I found the maximum points and the optimal number of evidence presentations within the time constraint, I had another problem which is how to find the sequence of ...

Actually, my program produces the correct answer for the above test case. However, I still do not understand why my program could not get accepted. >_<

Here is my code:

[cpp]
#include <stdio.h>
#include <math.h>

long long int save[100],used[100],num[100];
long long int result,m,n;

long long int ...

I am gonna go nuts because of this problem....
I got W.A 12 times.....

Can anyone give me some test cases to help me?

Thanks in advance.