#include<bits/stdc++.h> using namespace std; int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; char a[n][m]; int col[m]; memset(col, 0, sizeof(col)); long long res = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { vector<int> ranges; ranges.push_back(0); for (int j = 0; j < m; j++) { if (a[i][j] == '#') { col[j] = 0; } else { col[j]++; } if (j > 0 && a[i][j] != a[i][j - 1]) { ranges.push_back(j); } } ranges.push_back(m); for (int c = 1; c < ranges.size(); c++) { //cout << ranges[c] << " "; int left[m]; stack<int> st; for (int j = ranges[c - 1]; j < ranges[c]; j++) { while (!st.empty() && col[st.top()] >= col[j]) { st.pop(); } left[j] = st.empty() ? ranges[c - 1] - 1: st.top(); st.push(j); } while (!st.empty()) { st.pop(); } for (int j = ranges[c] - 1; j >= ranges[c - 1]; j--) { while (!st.empty() && col[st.top()] > col[j]) { st.pop(); } int right = st.empty() ? ranges[c]: st.top(); int mx = max((left[j] == ranges[c - 1] - 1 ? 0: col[left[j]]), (right == ranges[c] ? 0 : col[right])); st.push(j); //cout << i << " " << j << " " << left[j] << " " << right << "\n"; long long b = col[j] - mx, a = right - left[j] - 1; //cout << i << " " << j << " " << a << " " << b << "\n"; res += (a * a * (a + 1) / 2 - (a - 1) * a * (a + 1) / 3) * ((col[j] + mx + 1) * b / 2); } } //cout << "\n"; } cout << res << endl; return 0; }

strah.cpp: In function 'int main()':
strah.cpp:35:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for (int c = 1; c < ranges.size(); c++) {
      |                   ~~^~~~~~~~~~~~~~~