二维前缀和,cdq分治,树状数组离线询问

最新推荐文章于 2024-02-26 17:43:38 发布

Tao_oc

最新推荐文章于 2024-02-26 17:43:38 发布

阅读量171

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/weixin_41183791/article/details/88630444

版权

这篇博客介绍了如何使用二维前缀和与CDQ分治算法解决矩形区域覆盖问题。在蓝桥杯省赛模拟赛中，小腾面对农田监控的挑战，需要判断安装的监视器能否覆盖到所有可能的盗窃区域。题目要求通过矩形的坐标判断覆盖情况，博主提供了利用二维前缀和进行求解的方法，并给出了AC代码链接。

摘要由CSDN通过智能技术生成

2018 蓝桥杯省赛 A 组模拟赛（一）

解析:

询问矩形内点的值的和,二维前缀和,注意ll

ac:

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll mp[3000][3000];
ll dp[3000][3000];
ll w;

int main()
{
    memset(dp,0,sizeof(dp));
    memset(mp,0,sizeof(mp));
    int n,m,a,b,c,d;
    int x,y;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%d%lld",&x,&y,&w);
        x=x+1;
        y=y+1;
        mp[x][y]+=w;
    }
    for(int i=1;i<=2001;i++)
        for(int j=1;j<=2001;j++)
            dp[i][j]=mp[i][j]-dp[i-1][j-1]+dp[i][j-1]+dp[i-1][j];

    scanf("%d",&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d%d%d%d",&a,&b,&c,&d);
        a=a+1,b=b+1,c=c+1,d=d+1;
        cout<<dp[c][d]-dp[c][b-1]-(dp[a-1][d]-dp[a-1][b-1])<<endl;
    }
    return 0;
}

Monitor

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 163840/163840 K (Java/Others)
Total Submission(s): 914 Accepted Submission(s): 292

Problem Description

Xiaoteng has a large area of land for growing crops, and the land can be seen as a rectangle of n×m.
But recently Xiaoteng found that his crops were often stolen by a group of people, so he decided to install some monitors to find all the people and then negotiate with them.
However, Xiao Teng