Help with this dp problem

general
1
2
Code 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

int main() {
	// your code goes here
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        int n,k;
        cin>>n>>k;
        int ans=n;
        string s,temp,res;
        cin>>s;
        
        for(int i=0;i<=(n+3)/3;i++)
        res+="RGB";
        
        int arr1[n+1]={0},arr2[n+1]={0},arr3[n+1]={0};
        
        for(int j=0;j<n;j++)
        {
            if(res[j]!=s[j])
            arr1[j+1]++;
                
            if(res[j+1]!=s[j])
            arr2[j+1]++;
                
            if(res[j+2]!=s[j])
            arr3[j+1]++;
        }
        for(int i=2;i<=n;i++)
        {
            arr1[i]+=arr1[i-1];
            arr2[i]+=arr2[i-1];
            arr3[i]+=arr3[i-1];
        }
        for(int i=k;i<=n;i++)
        {
            int val1=arr1[i]-arr1[i-k];
            int val2=arr2[i]-arr2[i-k];
            int val3=arr3[i]-arr3[i-k];
            ans=min(ans,min({val1,val2,val3}));
        }
        
        cout<<ans<<"\n";
    }
}
3 
//SkGeN
#include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstring>
#include<climits>
#include<deque>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> p64;
typedef vector<ll> v64;
const int N = 2 * 1e5 + 10;
const ll inf = 1e18 + 100;
const ll mod = 1e9 + 7;
 
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,s,e) for(long long i=s;i<=e;i++)
#define brep(i,s,e) for(long long i=s;i>=e;i--)
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define DANGER std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

string st = "RGB";

void solve() {
	ll val , n;
	string s;
	cin>>n>>val>>s;
	ll ans = inf;

	for(int k = 0 ; k < 3; k++) {
		ll curr = 0;
		vector<ll> arr(s.size());
		for(int i = 0; i < s.size();  i++) {
			arr[i]= (s[i] != st[(k+i) % 3]);
			curr += arr[i];
			//cout<<st[(k+i) %3]<<"\n";
			if(i >= val) {
				curr -= arr[i - val];
				//ans = min(ans, curr);
			}
			if(i >= val - 1) {
				ans = min(ans , curr);
			}
			//cout<<curr<<"\n";	
		}
		//ans = min(ans , curr);
		//cout<<"\n\n";
	}
	cout<<ans<<"\n";
}
int main()
{
	DANGER;
	ll t = 1;
	cin>>t;
	while(t--) {
		solve();
	}
return 0;
}
//---->O ,,