对于这道题,我们设:
dp[i],为状态i及其子状态中最长的字符串
下面是ac代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#define ll long long
using namespace std;
int dp[100005];
char su[4000];
int main()
{
int t;
cin >> t;
while(t--)
{
memset(dp, 0, sizeof(dp));
int n, k;
scanf("%d%d", &n, &k);
scanf("%s", su);
for (int i = 0; i < n; i++)
{
int sta = 0;
for (int j = i; j < n; j++)
{
sta = sta | (1<<(su[j] - 'a'));
dp[sta] = max(dp[sta], j - i + 1);
}
}
for (int i = 0; i <(1<<k); i++)
{
for (int j = 0; j < k; j++)
{
if (i & (1<<j))
{
int _sta = i - (1 << j);
dp[i] = max(dp[i], dp[_sta]);
}
}
}
int ans = 0;
for (int i = 0; i < (1<<k); i++)
{
ans = max(ans, dp[i]*dp[((1<<k)-1)^i]);
}
printf("%d\n", ans);
}
}