题意
传送门 AtCoder ABC260 G Scalene Triangle Area
题解
暴力 + 前缀和
对每一行计算前缀和,处理每一个询问时暴力枚举每一行进行累加。总时间复杂度 O ( n ( n + q ) ) O\Big(n(n + q)\Big) O(n(n+q))。
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<string> ss(n);
for (int i = 0; i < n; ++i) {
cin >> ss[i];
}
vector<vector<int>> sum(n, vector<int>(n + 1));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
sum[i][j + 1] = sum[i][j] + (ss[i][j] == 'O');
}
}
int q;
cin >> q