Codeforces打卡（六）

最新推荐文章于 2024-09-27 11:26:03 发布

wxw我永远的神~

最新推荐文章于 2024-09-27 11:26:03 发布

阅读量100

点赞数

分类专栏： Codeforces补题文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/yuanxinya_/article/details/128402542

版权

Codeforces补题专栏收录该内容

28 篇文章 2 订阅

订阅专栏

本文分别解析了两个编程竞赛题目：EducationalCodeforcesRound97的B题和1433D题。B题中，程序通过计算字符串中连续0和1的最长子串来求解；D题则涉及寻找数组中不同元素的分隔符，并输出分隔位置。两题均使用C++语言实现，涉及字符串处理和数组操作技巧。

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

文章目录

Educational Codeforces Round 97 (Rated for Div. 2)B题

#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 2e5 + 10;
char s[N];

void solve()
{
     int n;
     cin >> n >> s + 1;
     int sum0 = 0, sum1 = 0;
     for (int i = 1; i <= n; i ++ )
     {
          if (s[i] == '1' && s[i + 1] == '1')
               sum0++;
          if (s[i] == '0' && s[i + 1] == '0')
               sum1++;
     }
     cout << max(sum1, sum0) << endl;
}

int main()
{
     ios::sync_with_stdio(false);
     cin.tie(0);
     cout.tie(0);
     int T;
     cin >> T;
     while (T--)
     {
          solve();
     }
     return 0;
}

https://codeforces.com/problemset/problem/1433/D题

#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;

const int N = 1e5 + 10;
int a[N];
map<int, int> mp;
vector<pair<int, int>> v;

void solve()
{
     mp.clear();
     int n;
     cin >> n;
     int b = -1, c = -1;
     int id;
     for (int i = 1; i <= n; i++)
     {
          cin >> a[i];
          mp[i] = a[i];
          if (i == 1)
               b = a[i];
          else if (i >= 2 && a[i] != b)
          {
               c = a[i];
               id = i;
          }
     }
     if (c == -1)
     {
          cout << "NO" << endl;
          return;
     }
     else
     {
          cout << "YES" << endl;
          for (int i = 2; i <= n; i++)
          {
               if (mp[i] != b)
                    v.push_back({1, i});
               else if (id != i && mp[i] == b)
                    v.push_back({id, i});
          }
          for (int i = 0; i < v.size(); i++)
          {
               cout << v[i].first << ' ' << v[i].second << endl;
          }
          v.clear();
     }
}

int main()
{
     ios::sync_with_stdio(false);
     cin.tie(0);
     cout.tie(0);
     int T;
     cin >> T;
     while (T--)
     {
          solve();
     }
     return 0;
}