HDU 5228-ZCC loves straight flush

Description

After losing all his chips when playing Texas Hold'em with Fsygd on the way to ZJOI2015, ZCC has just learned a black technology. Now ZCC is able to change all cards as he wants during the game. ZCC wants to get a Straight Flush by changing as few cards as possible. 

We call a five-card hand a Straight Flush when all five cards are consecutive and of the same suit. You are given a five-card hand. Please tell ZCC how many cards must be changed so as to get a Straight Flush. 
   
Cards are represented by a letter('A', 'B', 'C', 'D') which denotes the suit and a number('1', '2', $\cdots$, '13') which denotes the rank. 
   
Note that number '1' represents ace which is the largest actually. "1 2 3 4 5" and "10 11 12 13 1" are both considered to be consecutive while "11 12 13 1 2" is not.

 

Input

First line contains a single integer $T(T=1000)$ which denotes the number of test cases. 
For each test case, there are five short strings which denote the cards in a single line. It's guaranteed that all five cards are different.

 

Output

For each test case, output a single line which is the answer.

 

Sample Input

    
    

     
     3
A1 A2 A3 A4 A5
A1 A2 A3 A4 C5
A9 A10 C11 C12 C13 
    
    

 

Sample Output

    
    

     
     0
1
2 
    
    

暴力枚举 分四个数组 一旦有ABCD相应牌就扫一下该数组 更新MAX

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <map>
using namespace std;
#define INF 0x3f3f3f3f

int MAX,cnt;
void CNT(int a[])//对于数组从第一个元素开始每五个扫一下 看五个需要换多少张 扫到结束 如a[1-5] a[2-6] 比较更新MAX
{
    for(int i=1; i<=10; i++)
    {
        cnt=0;
        for(int j=i; j<i+5; j++)
        {
            if(a[j]==0) cnt++;
        }
        if(cnt<MAX) MAX=cnt;
    }
}
int main()
{
    int a,T;
    char c;
    scanf("%d",&T);
    while(T--)
    {
        int A[30]= {0},B[30]= {0},C[30]= {0},D[30]= {0};
        int aa=0,bb=0,cc=0,dd=0;
        for(int i=0; i<5; i++)
        {
            cin>>c>>a;
            getchar();
            if(c=='A')
            {
                A[a]=A[a+13]=1;
                aa=1;
            }
            else if(c=='B')
            {
                B[a]=B[a+13]=1;
                bb=1;
            }
            else if(c=='C')
            {
                C[a]=C[a+13]=1;
                cc=1;
            }
            else
            {
                D[a]=D[a+13]=1;
                dd=1;
            }
        }
        MAX=4;
        if(aa==1) CNT(A);
        if(bb==1) CNT(B);
        if(cc==1) CNT(C);
        if(dd==1) CNT(D);
        printf("%d\n",MAX);
    }
    return 0;
}