Sub Matrix Sum（UCF Local Programming Contest 2019（Practice），二分单调栈）

最新推荐文章于 2020-08-11 19:56:55 发布

Cu1ii*

最新推荐文章于 2020-08-11 19:56:55 发布

阅读量179

点赞数

原文链接：https://blog.csdn.net/The___Flash/article/details/107565806

版权

F. Sub Matrix Sum
在这里插入图片描述

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int M = (int)1e5;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll mod = (ll)1e9 + 9;
const double eps = 1e-6;

int R, C; ll S;
vector < vector<ll> > v;
ll b[M + 5];
int st[M + 5], tp;

int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    scanf("%d %d %lld", &R, &C, &S);
    if(R <= C)
    {
        v.resize(R + 1); for(int i = 0; i <= R; ++i) v[i].resize(C + 1);
        for(int i = 1; i <= R; ++i) for(int j = 1; j <= C; ++j) scanf("%lld", &v[i][j]);
    }
    else
    {
        v.resize(C + 1); for(int i = 0; i <= C; ++i) v[i].resize(R + 1);
        for(int i = 1; i <= R; ++i) for(int j = 1; j <= C; ++j) scanf("%lld", &v[j][i]);
        swap(R, C);
    }
    for(int i = 1; i <= R; ++i) for(int j = 1; j <= C; ++j) v[i][j] += v[i - 1][j];
    int l, r, mid; ll mi = inf;
    for(int i = 1; i <= R; ++i)
    {
        for(int j = i; j <= R; ++j)
        {
            for(int k = 1; k <= C; ++k) b[k] = b[k - 1] + v[j][k] - v[i - 1][k];
            tp = 0;
            for(int k = 1; k <= C; ++k)
            {
                l = 0, r = tp;
                while(l < r)
                {
                    mid = (l + r + 1) >> 1;
                    if(b[k] - b[st[mid]] >= S)  l = mid;
                    else                        r = mid - 1;
                }
                if(b[k] - b[st[r]] >= S) mi = min(mi, 1ll * (j - i + 1) * (k - st[r]));
                while(tp && b[k] <= b[st[tp]]) --tp;
                st[++tp] = k;
            }
        }
    }
    printf("%lld\n", mi == inf ? -1 : mi);
    return 0;
}