力扣316:
第二题:2447. 最大公因数等于 K 的子数组数目 - 力扣(LeetCode)
暴力法解题,一个个枚举。
class Solution {
public:
int gcd(int a, int b){
while (b != 0){
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int subarrayGCD(vector<int>& nums, int k) {
int n = (int)nums.size();
int res = 0;
for (int l = 0; l < n; l ++){
int g = nums[l];
for (int r = l; r < n; r ++){
g = gcd(g, nums[r]);
if (g == k){
res ++;
}
}
}
return res;
}
};
第三题:2448. 使数组相等的最小开销 - 力扣(LeetCode)
二分查找
class Solution {
public:
long long sumCost(const vector<int>& nums, const vector<int>& cost, int mid) {
const int n = nums.size();
long long ans = 0;
for (int i = 0;i < n;++i)
ans += 1ll * cost[i] * abs(nums[i] - mid);
return ans;
}
long long minCost(const vector<int>& nums, const vector<int>& cost) {
const auto [minit, maxit] = minmax_element(nums.begin(), nums.end());
long long lo = *minit, hi = *maxit;
while (lo < hi) {
const int mi = (lo + hi) / 2;
if (sumCost(nums, cost, mi) > sumCost(nums, cost, mi + 1))
lo = mi + 1;
else hi = mi;
}
return sumCost(nums, cost, lo);
}
};
acw74:
bfs,三维广搜
#include <iostream>
#include <queue>
using namespace std;
const int N = 20;
int dx[] = {0,0,0,0,1,-1},dy[] = {1,-1,0,0,0,0},dz[] = {0,0,1,-1,0,0};
int n,m,k;
char g[N][N][N];
int x,y;
bool vis[N][N][N];
struct point {
int x,y,z;
point () {}
point (int a,int b,int c) {
x = a,y = b,z = c;
}
};
queue <point> q;
int main () {
cin >> n >> m >> k;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= m;j++) {
for (int l = 1;l <= k;l++) cin >> g[i][j][l];
}
}
cin >> x >> y;
queue <point> q;
q.push (point (1,x,y));
int ans = 0;
vis[1][x][y] = true;
while (q.size ()) {
point t = q.front ();
q.pop ();
ans++;
for (int i = 0;i < 6;i++) {
int a = t.x + dx[i],b = t.y + dy[i],c = t.z + dz[i];
if (a < 1 || a > n || b < 1 || b > m || c < 1 || c > k || g[a][b][c] == '#' || vis[a][b][c]) continue;
q.push (point (a,b,c));
vis[a][b][c] = true;
}
}
cout << ans << endl;
return 0;
}