洛谷P2004 领地选择(简单dp/前缀和)

原题链接

#include <iostream>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <stdio.h>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define ll long long
inline ll read()
{
    ll k = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        k = k * 10 + ch - '0';
        ch = getchar();
    }
    return k * f;
}
#define inf 0x3f3f3f3f
ll sum[1005][1005];
ll dp[1005][1005];
ll a[1005][1005];
int main()
{
    ll n=read(),m=read(),c=read();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            a[i][j]=read();
            sum[i][j]=sum[i][j-1]+a[i][j];
            dp[i][j]=dp[i-1][j]+sum[i][j];
        }
    }
    ll ans=-10000000;
    ll a1,a2;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(i-c<0)break;
            if(j-c<0)continue;
            if(ans<dp[i][j]-dp[i-c][j]-dp[i][j-c]+dp[i-c][j-c])
            {
                a1=i-c+1;
                a2=j-c+1;
                ans=dp[i][j]-dp[i-c][j]-dp[i][j-c]+dp[i-c][j-c];
            }
        }
    }
    cout<<a1<<' '<<a2<<'\n';
}