传送门
分析
这个题分析起来有点模拟网络流的味道
首先每个点只会由两个点进行转移,我们设
r
e
s
i
res_i
resi为每一个点的流量,一个点的流量只会由
i
−
1
,
j
i - 1,j
i−1,j或者
i
,
j
−
1
i,j - 1
i,j−1进行转移,我们设
0
,
0
0,0
0,0为原点,流量无限,然后一行一行的去进行流量转移,如果发现
1
−
m
1 - m
1−m这些点的流量可以满足条件的话,原点就不用额外向
1
1
1点输入流量,否则,需要原点去补充这一行的流量
代码
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int res[N];
int n, m;
int main() {
int T;
read(T);
while (T--) {
read(n), read(m);
for (int i = 1; i <= m; i++) res[i] = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
stack<int> s;
s.push(0);
res[0] = INF;
for (int j = 1; j <= m; j++) {
int x;
read(x);
if (x > res[j]) {
int d = x - res[j];
while (res[s.top()] < d) d -= res[s.top()], res[s.top()] = 0, s.pop();
res[s.top()] -= d;
res[j] = x;
}
s.push(j);
}
ans += INF - res[0];
}
di(ans);
}
return 0;
}