1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<cstdio>
#include<cstring>
//#include<vector>
#include<algorithm>
#ifdef L_JUDGE
#pragma warning(disable:4996)
#endif
using namespace std;
const int MAXN=105;
int id[MAXN],id_cnt;
char str[MAXN];
int N;
void DFS(int *arr,int length,int max_level,int li,int di,int mask,int &ans){
    if(li==length){
        ans=max(ans,di);
        return;
    }
    if(di==max_level){
        ans=max(ans,di);
        return;
    }
    for(int i=li;i<length;i++){
        if(mask&arr[i])continue;
        DFS(arr,length,max_level,i+1,di+1,mask|arr[i],ans);
    }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX