C++差分，前缀和，贪心算法

最新推荐文章于 2024-07-11 22:03:57 发布

Polaris16197

最新推荐文章于 2024-07-11 22:03:57 发布

阅读量164

点赞数 2

文章标签： c++ 算法贪心算法

本文链接：https://blog.csdn.net/Polaris16/article/details/135955177

版权

文章介绍了C++中处理一维和二维数组的几种常见问题，包括数组元素的修改、区间更新后的求和以及特定条件下的元素计算。主要涉及输入输出、数组操作和竞赛算法技巧。

摘要由CSDN通过智能技术生成

一维形式

oj 3693

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int a[N], diff[N];
void solve(){
    int n, q;
    cin >> n >> q;
    for (int i=1; i<=n; i++) cin >> a[i];
    for (int i=1; i<=n; i++) diff[i] = a[i] - a[i-1];
    while (q--){
        int l, r, c;
        cin >> l >> r >> c;
        diff[l] += c, diff[r+1] -= c; 
    }
    for (int i=1; i<=n; i++) a[i] = a[i-1] + diff[i];
    for (int i=1; i<=n; i++) cout << a[i] << ' ';
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    solve();
    return 0;
}

二维形式

#include <bits/stdc++.h>
using LL = long long;
void solve(const int &Case){
    int n, m, q;
    std::cin >> n >> m >> q;
    std::vector<std::vector<LL>> a(n+1, std::vector<LL>(m+1)), b(n+1, std::vector<LL>(m+1));
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) std::cin >> a[i][j];
    while (q--){
        int x1, y1, x2, y2, c;
        std::cin >> x1 >> y1 >> x2 >> y2 >> c;
        x1--, y1--, x2--, y2--;
        b[x1][y1] += c;
        b[x2+1][y1] -= c;
        b[x1][y2+1] -= c;
        b[x2+1][y2+1] += c;
    }
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) b[i+1][j] += b[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) b[i][j+1] += b[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) a[i][j] += b[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) std::cout << a[i][j] << " \n"[j == m-1]; 
}
int main(){
    std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
    int T = 1;
    for (int i=1; i<=T; i++) solve(i);
    return 0;
}

#include <bits/stdc++.h>
using ll = long long;
void solve(const int &Case){
    int n, w;
    std::cin >> n >> w;
    std::vector<ll> a(2e5+1);
    for (int i=0; i<n; i++){
        int l, r, v;
        std::cin >> l >> r >> v;
        a[l] += v;
        a[r] -= v;
    }
    for (int i=1; i<=2e5; i++) a[i] += a[i-1];
    for (int i=0; i<=2e5; i++){
        if (a[i] > w){
            std::cout << "No\n";
            return;
        }
    }
    std::cout << "Yes\n";
}
int main(){
    std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
    int T = 1;
    for (int i=1; i<=T; i++) solve(i);
    return 0;
}

#include <bits/stdc++.h>
using ll = long long;
void solve(const int &Case){
    int n, k;
    std::cin >> n >> k;
    k = std::min(k, n);
    std::vector<std::pair<int, int>> a(n);
    ll sum = 0;
    for (int i=0; i<n; i++) std::cin >> a[i].first, sum += a[i].first;
    for (int i=0; i<n; i++) std::cin >> a[i].second;
    std::sort(a.begin(), a.end(), [&](const std::pair<int, int> &x, const std::pair<int, int> &y){
        return -x.first + x.second > -y.first + y.second;
    });
    for (int i=0; i<k; i++){
        if (a[i].second > a[i].first) sum += a[i].second - a[i].first;
        else break;
    }
    std::cout << sum << '\n';
}
int main(){
    std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
    int T = 1;
    for (int i=1; i<=T; i++) solve(i);
    return 0;
}