求助大佬,n*m为什么会TLE

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;


const int INF = 1e18;


class solution
{
    public:
        void solve();
};


void solution::solve()
{
    int n,m;cin>>n>>m;
    vector<int>a(n+2);
    for(int i=1;i<=n;i++)
        cin>>a[i];

    vector<int>b(n+2);

    for(int i=1;i<=n;i++)
    {
        int res = 0;
        int bt = 32-__builtin_clz(a[i]);
        for(int j=0;j<bt;j++)
            if(a[i]>>j&1)
                res += 1<<(bt-j-1);
        b[i] = res;
    }
    b[0] = 0;
    a[0] = 0;
    a[n+1] = b[n+1] = 0;
    // for(int i=1;i<=n;i++)
    //     cout<<b[i]-a[i]<<' ';
    // cout<<endl;
    LL f[n+2][m+1][2];
    for(int i=0;i<=n+1;i++)
        for(int j=0;j<=m;j++)
            f[i][j][0] = f[i][j][1] = -INF;
    f[0][0][0] = 0;

    for(int i=1;i<=n+1;i++)
    {
        for(int j=0;j<=m;j++)
        {
            // f[i][j][1] = max(f[i-1][j-1][0]+b[i],f[i-1][j][1] + b[i]);
            f[i][j][0] = max(f[i][j][0],f[i-1][j][0] + a[i]);
            f[i][j][0] = max(f[i][j][0],f[i-1][j][1] + a[i]);
            if(j)
                f[i][j][1] = max(f[i][j][1],f[i-1][j-1][0] + b[i]);
            f[i][j][1] = max(f[i][j][1],f[i-1][j][1] + b[i]);
            // f[i][j][0] = max(f[i-1][j][0],f[i-1][j][1]) + a[i];
        }
    }
    LL ans = 0;

    for(int i=0;i<=m;i++)
        // cout<<f[n][i][0]<<' '<<f[n][i][1]<<endl;
        ans = max(ans,max(f[n+1][i][0],f[n+1][i][1]));
    cout<<ans<<endl;

}


signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int T = 1;
    solution AC;
    //cin>>T;
    while(T --)
    {
        AC.solve();
    }
    return 0;
}