感觉和题解的想法没什么区别啊

#include <iostream>
using namespace std;

const int N=2e5+9;
int t, n, m, d, k, mp[N];
long long sum, f[N], s[109];

int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    cin >> t;  while (t--) {
        cin >> n >> m >> k >> d;
        for (int i=1; i<=n; i++) {
            for (int j=0; j<m; j++) {
                cin >> mp[j];
                f[j]=0x3f3f3f3f; if(!j) f[j]=1; 
                for (int l=1; l<=d+1 && j-l>=0; l++)
                    f[j]=min (f[j-l]+mp[j]+1, f[j]);
            }
        s[i]=f[m-1];
    }
    //for (int i=0; i<n; i++) cout << s[i] << endl; cout << endl;
    sum=0x3f3f3f3f3f3f3f3f;
    for (int i=1; i<=n; i++) s[i]+=s[i-1];
    for (int i=k; i<=n; i++)  sum=s[i]-s[i-k] < sum ? s[i]-s[i-k] : sum;
    cout << sum << '\n';
  }
}