#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, n) for (int i(j); i < n; ++i)
#define FORR(v, c) for (auto &v : c)
#define F first
#define S second
#define SQ(x) (x)*(x)
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define dbg(x) cerr<<#x<<" = " << (x) << endl
#define pnl(x) cout << x << '\n'
#define pns(x) cout << x << ' '
#define read(x) cin >> x
#define read2(x,y) cin >> x >> y
#define read3(x, y, z) cin >> x >> y >> z
#define read4(a, b, c, d) cin >> a >> b >> c >> d
#define readv(v) FORR(c,v) read(c)
struct Arrete { int v, c;};
struct Point {int x, y; double distance(Point other) const {return sqrt(SQ(x-other.x)+SQ(y-other.y));}};
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<Arrete> vg;
typedef vector<long long> vl;
typedef long long ll;
const int MAXN = 1e3;
ll height[MAXN][MAXN];
ll lowest[MAXN][MAXN];
ll largest[MAXN][MAXN];
int N,M;
struct Situation
{
ll wid, low;
};
int main(void)
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
read2(N,M);
FOR(i,0,N) FOR(j,0,M)
read(height[i][j]);
for (int col(0); col < M; ++col)
{
lowest[N-1][col] = 1;
for (int line(N-2); line >= 0; --line)
{
if (height[line][col] == height[line+1][col])
lowest[line][col] = lowest[line+1][col]+1;
else
lowest[line][col] = 1;
}
}
for (int line(0); line < N; ++line)
{
largest[line][0] = 1;
for (int col(1); col < M; ++col)
{
if (height[line][col-1] == height[line][col] && lowest[line][col] == lowest[line][col-1])
largest[line][col] = 1 + largest[line][col-1];
else
largest[line][col] = 1;
}
}
ll ans(0);
for (int line(0); line < N; ++line)
{
stack<Situation> S;
int prev_h = -1;
ll to_add = 0;
int col = M-1;
while (col >= 0)
{
ans += lowest[line][col] * ((largest[line][col] * (largest[line][col] + 1)) / 2);
Situation cur = {largest[line][col], lowest[line][col]};
if (prev_h != height[line][col])
{
while (!S.empty())
S.pop();
to_add = 0;
}
else
{
while (!S.empty && S.top().low >= cur.low)
{
Situation node = S.top();
S.pop();
cur.wid += node.wid;
to_add -= cur.wid * cur.low;
}
ans += largest[line][col] * to_add + largest[line][col] * (cur.wid - largest[line][col]) * cur.low;
S.push(cur);
}
col -= largest[line][col];
}
}
pnl(ans);
}
Compilation message
bob.cpp: In function 'int main()':
bob.cpp:96:15: error: cannot convert 'std::stack<Situation>::empty' from type 'bool (std::stack<Situation>::)() const' to type 'bool'
while (!S.empty && S.top().low >= cur.low)
^~~~~
bob.cpp:96:15: error: in argument to unary !
