Problem Description

We define the distance of two strings A and B with same length n is
disA,B=∑i=0n−1|Ai−Bn−1−i|
The difference between the two characters is defined as the difference in ASCII.
You should find the maximum length of two non-overlapping substrings in given string S, and the distance between them are less then or equal to m.

 

Input

The first line of the input gives the number of test cases T; T test cases follow.
Each case begins with one line with one integers m : the limit distance of substring.
Then a string S follow.

Limits
T≤100
0≤m≤5000
Each character in the string is lowercase letter, 2≤|S|≤5000
∑|S|≤20000

 

Output

For each test case output one interge denotes the answer : the maximum length of the substring.

 

Sample Input

 

Sample Output

 

Source

#include <bits/stdc++.h>

#define inf 0x3f3f3f3f

#define met(a,b) memset(a,b,sizeof a)

#define pb push_back

#define mp make_pair

#define rep(i,l,r) for(int i=(l);i<=(r);++i)

#define inf 0x3f3f3f3f

using namespace std;

typedef long long ll;

const int N = 5e3+;;

const int M = ;

const int mod = ;

const int mo=;

const double pi= acos(-1.0);

typedef pair<int,int>pii;

typedef pair<ll,int>P;

int n,m,ans;

char str[N];

void solve(){

    for(int len=;len<=n;len++){

        for(int l=,r=,res=;r<=len/;r++){

            res+=abs(str[r]-str[len-r+]);

            while(res>m){

                res-=abs(str[l]-str[len-l+]);

                l++;

            }

            ans=max(ans,r-l+);

        }

    }

}

int main(){

    int T;

    scanf("%d",&T);

    while(T--){

        scanf("%d",&m);

        scanf("%s",str+);

        n=strlen(str+);

        ans=;

        solve();

        reverse(str+,str++n);

        solve();

        printf("%d\n",ans);

    }

    return ;

}