题目传送门
题意: 给一个n * m大小的距阵a,让你求出其所有k * k的子矩阵的最大值之和,其中a[i][j]=lcm(i,j)。(n,m<=5000,k<=min(n,m))
思路: 首先是求lcm,我们当然可以枚举所有点,然后a[i][j]=i*j/__gcd(i,j),这样做的复杂度是n2 logn,题解中给出了一种更快的递推方法。
然后是求最大值。我们用ma[i][j]表示a[i][j-k+1] 到a[i][j]中的最大值,然后我们可以用单调队列先对每一行,更新这一行的ma[i][j],然后在遍历每一列,求ma[i-k+1][j]到ma[i][j]的最大值,这样,他就是距阵ma[i-k+1][j-k+1]到ma[i][j]的最大值。
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
//#define int long long
#define pii pair<int,int>
#define pdd pair<double,double>
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read(){int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=gc();}
return x*f;}
using namespace std;
const int N=5e3+5;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const double eps=1e-7;
const double PI=acos(-1);
int ma[N][N];
signed main()
{
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(!ma[i][j])
for(int k=1;k*i<=n&&k*j<=m;k++)
ma[k*i][k*j]=i*j*k;
}
}
for(int i=1;i<=n;i++)
{
deque<int>q;
for(int j=1;j<=k-1;j++)
{
while(q.size()&&ma[i][q.back()]<=ma[i][j])
q.pop_back();
q.push_back(j);
}
for(int j=k;j<=m;j++)
{
int l=j-k+1;
while(q.size()&&ma[i][q.back()]<=ma[i][j])
q.pop_back();
q.push_back(j);
while(q.size()&&q.front()<l)
q.pop_front();
ma[i][j]=ma[i][q.front()];
}
}
ll res=0;
for(int j=k;j<=m;j++)
{
deque<int>q;
for(int i=1;i<=k-1;i++)
{
while(q.size()&&ma[q.back()][j]<=ma[i][j])
q.pop_back();
q.push_back(i);
}
for(int i=k;i<=n;i++)
{
int l=i-k+1;
while(q.size()&&ma[q.back()][j]<=ma[i][j])
q.pop_back();
q.push_back(i);
while(q.size()&&q.front()<l)
q.pop_front();
res+=ma[q.front()][j];
}
}
cout<<res<<endl;
}