冲刺蓝桥杯好题合集 + 最优解题代码【坚持刷完稳冲国一！！！】（第一弹）

已于 2023-04-02 21:05:44 修改
阅读量84 收藏
点赞数 2
文章标签： 蓝桥杯 算法 c++
于 2023-03-30 19:51:05 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/coooode_king/article/details/129827288
版权
文章展示了多个基于前缀和的算法问题，如数组截断、子矩阵和、K倍区间等，并介绍了使用深度优先搜索（DFS）和广度优先搜索（BFS）解决排列、n-皇后、递归枚举和迷宫路径等问题。还涉及了斐波那契数列和状态压缩的技术应用。
摘要由CSDN通过智能技术生成

  • 专题一 前缀和

acwing.3956截断数组

#include<iostream>

using namespace std;

typedef long long LL; //数据范围大于10^10可能会爆int
const int N = 100010;

int n;
int a[N];
LL sum, tot, t, res; //sum所有值之和，tot为当前累加的数值
                     // t为已经搜出的满足前一段之和==sum/3的点的个数    
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++) 
        scanf("%d", &a[i]), sum += a[i];
    if(sum % 3) cout << 0;  //优化，不能拆成三等份的一定无解
    else
    {
        LL mid = sum / 3;
        for(int i = 1 ; i < n; i ++)
        {
            tot += a[i]; 
            if(tot == mid * 2) res += t; // 先加后计数
            if(tot == mid) t ++;
            //不能调换这两个if判断的原因是：如果出现tot同时等于sum和sum*2时（比如0特判等），就会出现在同一位自加
            //一旦出现自加，那么可以理解为中间那个截断元素个数为0，这是不可能的
        }
        cout << res << endl;
    }    
    return 0;
}

acwing.795前缀和

#include<iostream>

using namespace std;

const int N = 100010;

int n, t;
int s[N];

int main()
{
    cin >> n >> t;
    for(int i = 1; i <= n; i ++)
    {
        scanf("%d", &s[i]);
        s[i] += s[i - 1]; // 若只需查询不需要修改，可使合并a【】和s【】
    }
    
    while(t -- )
    {
        int l, r;
        scanf("%d%d", &l, &r);
        printf("%d\n", s[r] - s[l - 1]); // 勿忘-1
    }
    return 0;
}

acwing.796子矩阵的和

#include<iostream>

using namespace std;

const int N = 1010;

int n, m, q;
int s[N][N];

int main()
{
    cin >> n >> m >> q;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
        {
            scanf("%d", &s[i][j]); // 二维前缀和如果值查询不修改可以合并a【】和s【】
            s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1]; 
        }
    
    while(q -- )
    {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2); //画图联想记忆
        printf("%d\n", s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]);
    }
    return 0;
}

acwing.1230 k倍区间

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

long long n, a[N], s[N], cnt[N], res, k;

int main() // 前缀和数组中摸k相等的两个点可以组成一个k倍区间
{
    cin >> n >> k;
    cnt[0] = 1;
    for(int i = 1; i <= n; i ++) // 整个过程可以优化进一层循环中
    {
        scanf("%lld", &a[i]);
        s[i] = (s[i - 1] + a[i]) % k;
        res += cnt[s[i]]; 
        cnt[s[i]] ++; // 看到加减与取模运算应该想到同余运算
    }
    cout << res <<endl;
    return 0;
}

acwing.99激光炸弹

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 5010;

int n, r;
int s[N][N];

int main()
{
    cin >> n >>r;
    r = min(r, 5001); //注意数据范围，当r不能大于范围
    for(int i = 1; i <= n; i ++)
    {
        int x, y, w;
        scanf("%d%d%d", &x, &y, &w);
        s[++x][++y] += w; //x，y右移一位避免对边界值讨论
    }
    
    for(int i = 1; i <= 5001; i ++)
        for(int j = 1; j <= 5001; j ++)
            s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
            
    int res = 0;
    for(int i = r; i <= 5001; i ++) // 在二维数组中遍范围方法
        for(int j = r; j <= 5001; j ++)
            res = max(res, s[i][j] - s[i - r][j] - s[i][j - r] + s[i - r][j - r]);
            
    cout << res << endl;
    return 0;
}

  • 专题二.DFS && BFS（蓝桥杯重中之重）


AcWing 842. 排列数字

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 10;

int n;
int path[N]; // 用二进制数代替判重数组

void dfs(int u, int state)
{
    if(u == n) //到叶子节点==当前方案已完成，输出
    {
        for(int i = 0; i < n; i ++)
            printf("%d ", path[i]);
        puts("");
        return;
    }
    
    for(int i = 0; i < n; i ++)
        if(!(state >> i & 1)) //二进制数第i位为1 == i已被用过
        {
            path[u] = i + 1;
            dfs(u + 1, state + (1 << i));// 将第i位数置成1
        }
}

int main()
{
    cin >> n;
    dfs(0, 0);
    return 0;
}

AcWing 843. n-皇后问题 

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 20;

int n;
char g[N][N];
bool col[N], dg[N], udg[N];

void dfs(int u)
{
    if(u == n)
    {
        for(int i = 0; i < n; i ++) puts(g[i]);
        puts("");
        return;
    }   
    
    for(int i = 0; i < n; i ++ )
    {
        if(!col[i] && !dg[u + i] && !udg[n - u + i])
        {
            g[u][i] = 'Q';
            col[i] = dg[u + i] = udg[n - u + i]= true;
            dfs(u + 1);
            col[i] = dg[u + i] = udg[n - u + i]= false;
            g[u][i] = '.';
        }
    }
}
int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < n; j ++)
            g[i][j] = '.';
    
    dfs(0);
    
    return 0;
}

AcWing 92. 递归实现指数型枚举

要求升序
st[u] == 0 还没考虑
st[u] == 1 选
st[u] == 2 不选

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

const int N = 16;

int n;
int st[N];

void dfs(int u)
{
    if(u > n)
    {
        for(int i = 1; i <= n; i ++)
            if(st[i] == 1)
                printf("%d ", i);
        puts("");
        return ;
    }

    st[u] = 2;
    dfs(u + 1);
    st[u] = 0;

    st[u] = 1;
    dfs(u + 1);
    st[u] = 0;
}

int main()
{
    cin >> n;

    dfs(1);

    return 0;
}


不要求升序
#include<iostream>

using namespace std;

const int N = 16;

int n;
int a[N];

void dfs(int pos, int tar)
{
    if(pos == tar + 1)
    {
        for(int i = 1; i <= tar; i ++)
            printf("%d ", a[i]);
        puts("");
        return;
    }

    for(int i = 1; i <= n; i ++)
    {
        a[pos] = i;
        dfs(pos + 1, tar);
    }
}

int main()
{
    puts(""); // 不取

    cin >> n;

    for(int i = 1; i <= n; i ++)
        dfs(1, i);

    return 0;
}

状态压缩非递归
#include<iostream>

using namespace std;

const int N = 16;

int n;

int main()
{
    cin >> n;
    for(int state = 0; state < 1 << n; state ++)
    {
        for(int j = 0; j < n; j ++)
            if(state >> j & 1) printf("%d ", j + 1);
        puts("");
    }

    return 0;
}

状态压缩递归
#include<iostream>

using namespace std;

const int N = 16;

int n;

void dfs(int u, int state)
{
    if(u == n)
    {
        for(int i = 0; i < n; i ++)
            if(state >> i & 1)
                printf("%d ", i + 1);
        puts("");
        return ;
    }

    dfs(u + 1, state);
    dfs(u + 1, state | (1 << u));
}

int main()
{
    cin >> n;

    dfs(0, 0);

    return 0;
}

AcWing 717. 简单斐波那契 

#include<iostream>

using namespace std;

long long n, a, b = 1, c;

int main()
{
    cin >> n;
    while(n -- )
    {
        printf("%d ", a);
        c = a + b;
        a = b, b = c;
    }
    return 0;
}

acwing95. 费解的开关

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 6;

char g[N][N], backup[N][N];
int dx[5] = {-1, 0, 1, 0, 0}, dy[5] = {0, 1, 0, -1, 0};

void turn(int x, int y)
{
    for (int i = 0; i < 5; i ++ )
    {
        int a = x + dx[i], b = y + dy[i];
        if (a < 0 || a >= 5 || b < 0 || b >= 5) continue;
        g[a][b] ^= 1;
    }
}

int main()
{
    int T;
    cin >> T;
    while (T -- )
    {
        for (int i = 0; i < 5; i ++ ) cin >> g[i];

        int res = 10;
        for (int op = 0; op < 32; op ++ ) //暴力枚举第一行所有可能的操作
        {
            memcpy(backup, g, sizeof g);
            int step = 0;
            for (int i = 0; i < 5; i ++ )
                if (op >> i & 1)
                {
                    step ++ ;
                    turn(0, i);
                }

            for (int i = 0; i < 4; i ++ )
                for (int j = 0; j < 5; j ++ )
                    if (g[i][j] == '0')
                    {
                        step ++ ;
                        turn(i + 1, j);
                    }

            bool dark = false;
            for (int i = 0; i < 5; i ++ )
                if (g[4][i] == '0')
                {
                    dark = true;
                    break;
                }

            if (!dark) res = min(res, step);
            memcpy(g, backup, sizeof g);
        }

        if (res > 6) res = -1;

        cout << res << endl;
    }

    return 0;
}

AcWing 93. 递归实现组合型枚举

#include<iostream>

using namespace std;

const int N = 30;

int n, m;
int path[N];

void dfs(int u, int start) //state表示从哪一个数开始枚举从而保证字典序输出
{
    if(u > m)
    {
        for(int i = 1; i <= m; i ++)
            printf("%d ", path[i]);
        puts("");
    }
    else
    {
        for(int i = start; i <= n; i ++)
        {
            path[u] = i;
            dfs(u + 1, i + 1);
            path[u] = 0;
        }
    }
}

int main()
{
    cin >> n >> m;
    dfs(1, 1);
    return 0;
}

844. 走迷宫

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>

using namespace std;

typedef pair<int,int> PII;

const int N = 110;

int n, m ;
int g[N][N], d[N][N];

int bfs()
{
    queue<PII> q;

    memset(d, -1, sizeof d);
    d[0][0] = 0;
    q.push({0, 0});

    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

    while(q.size())
    {
        auto t = q.front();
        q.pop();

        for(int i = 0 ; i < 4 ; i ++)
        {
            int x = t.first + dx[i], y = t.second + dy[i];

            if(x >= 0 && x < n && y >= 0 && y < m && d[x][y] == -1 && g[x][y] == 0)
            {
                d[x][y] = d[t.first][t.second] + 1;
                q.push({x, y});
            }
        }
    }
    return d[n - 1][m - 1];
}

main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < m; j ++)
            scanf("%d", &g[i][j]);

    cout << bfs();
    return 0;
}

AcWing 1209. 带分数

//暴力杯的暴力做法

#include<cstdio>
#include<cstring> 
#include<iostream>

using namespace std;

const int N = 10;

int n, ans;
int num[N];
bool used[N];

int calc(int l, int r)
{
    int res = 0;
    for(int i = l; i <= r; i ++)
        res = res * 10 + num[i];
    return res;
}

void dfs(int u)
{
    if(u == 9)
    {
        for(int i = 0; i < 7; i ++)  // 注意区间端点取值
            for(int j = i + 1; j < 8; j ++) // 枚举a，b，c所有的可能取值
            {
                int a = calc(0, i);
                int b = calc(i + 1, j);
                int c = calc(j + 1, 8);
                if(a * c + b == c * n)ans ++;
            }
            return;
    }
    for(int i = 1; i <= 9; i ++ ) 
    {
        if(!used[i])
        {
            used[i] = true;
            num[u] = i;
            dfs(u + 1);
            used[i] = false ;
        }
    }
}

int main()
{
    cin >> n;

    dfs(0);

    cout << ans << endl;

    return 0;
}
*/

//优化版
#include<cstdio>
#include<cstring> 
#include<iostream>

using namespace std;

const int N = 10;

int n;
bool st[N], backup[N];
int ans;

bool check(int a, int c)
{
    long long b = n * (long long)c - a * c;

    if(!a || !b || !c) return false ;

    memcpy(backup, st, sizeof st);
    while(b)
    {
        int x = b % 10;
        b /= 10;
        if(!x || backup[x]) return false;
        backup[x] = true;
    }

    for(int i = 1; i <= 9; i ++)
        if(!backup[i])
            return false ;

    return true;
}

void dfs_c(int u, int a, int c)
{
    if(u > 9) return ;

    if(check(a, c)) ans ++;

    for(int i = 1; i <= 9; i ++)
        if(!st[i])
        {
            st[i] = true;
            dfs_c(u + 1, a, c * 10 + i);
            st[i] = false ;
        }
}

void dfs_a(int u, int a)
{
    if(a >= n) return ;
    if(a) dfs_c(u, a, 0);

    for(int i = 1; i <= 9; i ++)
        if(!st[i])
        {
            st[i] = true;
            dfs_a(u + 1, a * 10 + i);
            st[i] = false ;
        }
}

int main()
{
    cin >> n;

    dfs_a(0, 0);

    cout << ans << endl;

    return 0;
}

//
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 10;

int target;
int num[N];

int calc(int l, int r)
{
    int res = 0;
    for(int i = l; i <= r; i ++)
        res = res * 10 + num[i];
    return res;
}

int main()
{
    cin >> target;
    for(int i = 0; i < 9; i ++) num[i] = i + 1;

    int res = 0;
    do
    {
        for(int i = 0; i < 9; i ++)
            for(int j = i; j < 9; j ++)
            {
                int a = calc(0, i);
                int b = calc(i + 1, j);
                int c = calc(j + 1, 8);
                if(a == 0 || b == 0 || c == 0) continue;
                if(a * c + b == target * c) res ++;
            }
    }while(next_permutation(num, num + 9));  

    cout << res << endl;
    return 0;
}

//

AcWing 116. 飞行员兄弟

AcWing 845. 八数码

#include <iostream>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <queue>

using namespace std;

const int N = 6;

char g[N][N];
bool st[N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

int bfs(string start)
{
    queue<string> q; //存储待处理的字符
    unordered_map<string,int> d; //将字符和映射到一维的下表联系起来
    
    q.push(start); 
    d[start] = 0;
    
    string end = "12345678x"; // 二维映射到一维
    while(q.size())
    {
        auto t = q.front();
        q.pop();
        
        if(t == end) return d[t]; // 当完成目标时输出步数
        
        int distance = d[t];
        
        int k = t.find('x');  // 查询x在一维中的坐标
        int x = k / 3, y = k % 3; // 将一维转化为二维
        for(int i = 0; i < 4; i ++) 
        {
            int a = x + dx[i], b = y + dy[i];
            if(a >= 0 && a < 3 && b >= 0 && b < 3)
            {
                swap(t[a * 3 + b], t[k]); // 交换时将二维转化为一维
                if(!d.count(t)) // 第一次遍历时加入队列并且更新距离
                {
                    d[t] = distance + 1;
                    q.push(t);
                }
                swap(t[a * 3 + b], t[k]); // 还原状态，准备下一次遍历
            }
        }
    }
    return -1;
}

int main()
{
    string str, start;
    while(cin >> str) start += str; // 读入包括空格的字符串
    cout << bfs(start) << endl;
    return 0;
}

AcWing 3156. 卡片换位

#include <iostream>
#include <queue>
#include <unordered_map>
#include <algorithm>

using namespace std;

int a,b;
string s;
string end;
int dx[4] = {-1,0,1,0}, dy[4] = {0,1,0,-1};

int bfs()
{
    queue<string> q;
    unordered_map<string,int> dist;
    q.push(s);
    dist[s] = 0;
 
    while(q.size())
    {
        auto t = q.front();
        q.pop();

        int distance = dist[t];
        if(t.find('A') == a && t.find('B') == b) return distance;

        int pos = t.find(' ');
        int x = pos / 3, y = pos % 3;
        for(int i = 0; i < 4;i ++ )
        {
            int a = x + dx[i], b = y + dy[i];
            if(a >=0 && a < 2 && b >= 0 && b < 3) 
            {
                swap(t[pos],t[a * 3 + b]);
                if(!dist.count(t))
                {
                    q.push(t);
                    dist[t] = distance + 1;
                }
                swap(t[pos],t[a * 3 + b]); // 回溯
            }

        }
    }
}

int main()
{
    for(int i = 0;i < 2;i ++ )
    {
        string a;
        getline(cin,a); // 读取带空格的字符串，整行读取
        s += a;
    }
    
    for(int i = 0;i < 6;i ++ )
        if(s[i] == 'A') b = i;
        else if(s[i] == 'B') a = i;

    cout << bfs();

    return 0;
}

AcWing 1233. 全球变暖

bfs
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

#define x first
#define y second

using namespace std;

typedef pair<int, int> PII;

const int N = 1010;

int n;
char g[N][N];
bool st[N][N];
PII q[N * N];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

void bfs(int sx, int sy, int &total, int &bound)
{
    int hh = 0, tt = 0;
    q[0] = {sx, sy};
    st[sx][sy] = true;

    while(hh <= tt )
    {
        PII t = q[hh ++];
        total ++;
        bool is_bound = false ;
        for(int i = 0; i < 4; i ++)
        {
            int x = t.x + dx[i], y = t.y + dy[i];
            if(x < 0 || x >= n || y < 0 | y >= n) continue;
            if(st[x][y]) continue;
            if(g[x][y] == '.')
            {
                is_bound = true;
                continue;
            }
            q[++ tt] = {x, y};
            st[x][y] = true;
        }
        if(is_bound) bound ++;
    }
}


int main()
{
    cin >> n;

    for(int i = 0; i < n; i ++) scanf("%s", &g[i]);

    int cnt = 0;
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < n; j ++)
            if(!st[i][j] && g[i][j] == '#')
            {
                int total = 0, bound = 0;
                bfs(i, j, total, bound);
                if(total == bound) cnt ++; 
            }
    cout << cnt << endl;
    return 0;
}
*/






//dfs

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

const int N = 1010;

int n, flag;
char g[N][N];
bool st[N][N];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

void dfs(int sx, int sy)
{
    st[sx][sy] = true;
    if(g[sx][sy + 1] == '#' && g[sx][sy - 1] == '#' &&
        g[sx + 1][sy] == '#' && g[sx - 1][sy] == '#')
        flag = 1;
    for(int i = 0; i < 4; i ++)
    {
        int x = sx + dx[i], y = sy + dy[i];
        if(!st[x][y] && g[x][y] == '#')
            dfs(x, y);
    }
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++)
        scanf("%s", &g[i]);

    int cnt = 0;
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < n; j ++)
            if(g[i][j] == '#' && !st[i][j])
            {
                flag = 0;
                dfs(i, j);
                if(!flag) cnt ++;
            }
    cout << cnt << endl;
    return 0;
}

AcWing 1562. 微博转发

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 1010, M = 100010;

int n, L;
int h[N], e[M], ne[M], idx;
bool st[N];

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}

int bfs(int start)
{
    queue<int> q;
    memset(st, 0, sizeof st);
    q.push(start);
    st[start] = true;

    int res = 0;
    for (int i = 0; i < L; i ++ )
    {
        int sz = q.size();
        while (sz -- )
        {
            int t = q.front();
            q.pop();
            for (int j = h[t]; j != -1; j = ne[j])
            {
                int x = e[j];
                if (!st[x])
                {
                    q.push(x);
                    st[x] = true;
                    res ++ ;
                }
            }
        }
    }

    return res;
}

int main()
{
    scanf("%d%d", &n, &L);

    memset(h, -1, sizeof h);
    for (int i = 1; i <= n; i ++ )
    {
        int cnt;
        scanf("%d", &cnt);
        while (cnt -- )
        {
            int x;
            scanf("%d", &x);
            add(x, i);
        }
    }

    int m;
    scanf("%d", &m);
    while (m -- )
    {
        int x;
        scanf("%d", &x);
        printf("%d\n", bfs(x));
    }

    return 0;
}

蓝桥杯2022国赛   最大数字

#include<iostream>

using namespace std;

typedef long long LL; //超过10^10次方会爆int

char c[20];
LL ans = 0;
int n, m;

void dfs(int i, LL v) // 第一参数为当前递归位数，第二参数为目前维护的新数
{
	int x = c[i] - '0'; 
	if(c[i]) // 如果该位数不等于0
  {
		int t = min(n, 9 - x); // 不够就全加上，够的话加到9
		n -= t; 
		dfs(i + 1, v * 10 + x + t); //递归到下一位数，并更新新数
		n += t; // 回溯
    if(m > x) // 再考虑减法，前提时可以减到0
    {
			m -= x + 1; 
			dfs(i + 1, v * 10 + 9);
			m += x + 1;
		}
	}
  else ans = max(ans, v); // 更新全局变量
}

int main() 
{
	scanf("%s%d%d", c, &n, &m);
	
  dfs(0, 0);

	printf("%lld\n", ans);
    return 0;
}

AcWing 4946. 叶子节点

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 200010, M = 2 * N ;

int n, m, a, b;
int cnt, h[N], w[N], e[M], ne[M], idx;

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

int dfs(int u, int fa, int cnt, bool valid)
{
    if(w[u]) cnt ++;
    else cnt = 0;
    
    if(cnt > m) valid = false;
    
    int res = 0, sons = 0;
    for(int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if(j == fa) continue;
        sons ++;
        res += dfs(j, u, cnt, valid);
    }
    if(!sons && valid) res ++;
    return res;
 }

int main()
{
    memset(h, -1, sizeof h);
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) scanf("%d", &w[i]);
    for(int i = 0; i < n - 1; i ++)
    {
        scanf("%d%d", &a, &b);
        add(a, b), add(b, a);
    }
    
    cout << dfs(1, -1, 0, true) << endl;

    return 0;
}

  • 专题三  差分

AcWing 797. 差分

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

int n, m;
int a[N], b[N];

void insert(int l, int r, int c)
{
    b[l] += c;
    b[r + 1] -= c;
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) scanf("%d", &a[i]); 
    for(int i = 1; i <= n; i ++) insert(i, i, a[i]); // 预处理差分数组
    while(m -- )
    {
        int l, r, c;
        cin >> l >> r >> c;
        insert(l, r, c);
    }
    for(int i = 1; i <= n; i ++) b[i] += b[i - 1]; // 将差分数组转化 
    
    for(int i = 1; i <= n; i ++) printf("%d ", b[i]);
    
    return 0;
}

AcWing 798. 差分矩阵

#include <iostream>

using namespace std;

const int N = 1010;

int n, m, q;
int a[N][N], b[N][N];

void insert(int x1, int y1, int x2, int y2, int c) 
{
    b[x1][y1] += c;
    b[x2 + 1][y1] -= c;
    b[x1][y2 + 1] -= c;
    b[x2 + 1][y2 + 1] += c;
}

int main()
{
    scanf("%d%d%d", &n, &m, &q);

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
            scanf("%d", &a[i][j]);

    for (int i = 1; i <= n; i ++ )  // 初始化二维差分数组
        for (int j = 1; j <= m; j ++ )
            insert(i, j, i, j, a[i][j]);

    while (q -- )
    {
        int x1, y1, x2, y2, c;
        cin >> x1 >> y1 >> x2 >> y2 >> c;
        insert(x1, y1, x2, y2, c);
    }

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ ) //差分数组求前缀和即为新数组
            b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];

    for (int i = 1; i <= n; i ++ )
    {
        for (int j = 1; j <= m; j ++ ) printf("%d ", b[i][j]);
        puts("");
    }

    return 0;
}

AcWing 100. 增减序列

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long LL; // 一看数据范围就知道肯定要超时

const int N = 100010;

LL n, pos, neg; // pos记录正数和， neg记录负数和
LL a[N], b[N]; 

int main()
{
    cin >> n;
    for(LL i = 1; i <= n; i ++) 
    {
        scanf("%d", &a[i]);
        b[i] = a[i] - a[i - 1]; 
        if(b[i] > 0 && i > 1) pos += b[i]; // b[1] == a[1] 故只需满足b[2 ~ n] == 0
        else if(b[i] < 0 && i > 1) neg -= b[i];
    }

    cout << min(pos, neg) + abs(pos - neg) << endl;
    cout << abs(pos - neg) + 1 << endl;
    return 0;
}

  • 专题四 二分

AcWing 789. 数的范围

#include<iostream>

using namespace std;

const int N = 100010;

int n, q;
int a[N];

int main()
{
    cin >> n >> q;
    for(int i = 0; i < n; i ++)
        scanf("%d", &a[i]);
        
    while(q -- )
    {
        int k;
        cin >> k;
        int l = 0, r = n - 1; 
        while(l < r)
        {
            int mid = l + r >> 1;
            if(a[mid] >= k) r = mid;
            else l = mid + 1;
        }
        if(a[l] == k) // 提前判断是否有解
        {
            cout << l << ' ';
            l = 0, r = n - 1;
            while(l < r)
            {
                int mid = l + r + 1 >> 1;
                if(a[mid] <= k) l = mid;
                else r = mid - 1;
            }
            cout << l << endl;
        }
        else puts("-1 -1");
    }
    return 0;
}

AcWing 1227. 分巧克力

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

int n, k;
int w[N], h[N];

bool check(int mid)
{
    int res = 0;
    for(int i = 0; i < n; i ++)
    {
        res += (h[i] / mid) * (w[i] / mid); //每一大块可以分成的边长为 a 的巧克力数量
        if(res >= k) return true;//大于要求数量，返回真
    }
    return false;
}
int main()
{
    cin >> n >> k;
    for(int i = 0; i < n; i ++) 
        scanf("%d%d", &h[i], &w[i]);

    int l = 0, r = N;//小巧克力数量边长一定在 1 -- 100000 之间
    while(l < r)
    {
        int mid = r + l + 1 >> 1;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }

    cout << r << endl;

    return 0;
}

AcWing 1460. 我在哪？

暴力解法
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int n;
string str;

int main()
{
    cin >> n >> str;


    for(int len = 1; len <= n; len ++) //最外层枚举不重复长度
    {
        bool flag = false ;
        for(int i = 0; i + len - 1 < n; i ++) // 枚举第一个字串
        {
            for(int j = i + 1; j + len - 1 < n; j ++) //枚举第二个字串
            {
                bool same = true;
                for(int u = 0; u < len; u ++) // 枚举两个字串是否有相同部分
                    if(str[i + u] != str[j + u])
                    {
                        same = false ;
                        break;
                    }
                if(same)
                {
                    flag = true;
                    break;
                }
            }
            if(flag) break;
        }
        if(!flag) 
        {
            cout << len << endl;
            return 0;
        }
    }
}


//二分 + 哈希set
#include <iostream>
#include <cstring>
#include <algorithm>
#include <unordered_set>

using namespace std;

int n;
string str;
unordered_set<string> s;

bool check(int mid)
{
    s.clear();
    for(int i = 0; i + mid - 1 < n; i ++)
    {
        string c = str.substr(i, mid);
        if(s.count(c)) return false;
        s.insert(c);
    }
    return true;
}

int main()
{
    cin >> n >> str;

    int l = 1, r = n;
    while(l < r)
    {
        int mid = l + r >> 1;
        if(check(mid)) r = mid;
        else l = mid + 1;
    }
    cout << l << endl;
    return 0;
}

WWJJ！
关注
  • 2
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值