2023年第六届广西大学生程序设计竞赛（热身赛）

最新推荐文章于 2024-05-23 17:21:42 发布

mingyu19

最新推荐文章于 2024-05-23 17:21:42 发布

阅读量222

点赞数

分类专栏： ACM 文章标签： c++

本文链接：https://blog.csdn.net/m0_63216173/article/details/131027182

版权

ACM 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Lowbit

在这里插入图片描述

#include <bits/stdc++.h>
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
using namespace std;

int main() {
    string s; cin >> s;
    
    reverse(s.begin(), s.end());
    s += "00";
    
    int j =0, cnt = 0;
    for (int i = 0; i < s.size()+1; i ++ ) {
        if(s[i] == '1' && s[i+1] == '0') cnt += 1;
        if(s[i] == '1' && s[i+1] == '1') {
            j = i + 1, s[i] = '0';
            while(j < s.size() && s[j] == '1') {
                s[j] = '0', j ++ ;
            }
//             cout << i << ' ' << j << endl;
            s[j] = '1', i = j - 1, cnt += 1;
        }
    }
    cout << cnt;
}

Homework

在这里插入图片描述

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
    int n; cin >> n;
    int maxn_a = 0, maxn_c = 0, x = 0;
    for (int i = 1; i <= n; i ++ ) {
        cin >> x;
        maxn_a = max(maxn_a, x);
    }
    long long sum = 0;
    for (int i = 1; i <= n; i ++ ) {
        cin >> x;
        sum += x;
        maxn_c = max(maxn_c, x);
    }
    cout << (long long)(maxn_a + sum - maxn_c);
}