牛客周赛 Round 35

牛客周赛 Round 35

A. 小红的字符串切割

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> PII;

int main(){
    string s;
    cin >> s;
    for(int i = 0; i < s.size(); i++){
        if(i == s.size() / 2) cout << endl;
        cout << s[i];
    }
    return 0;
}

B. 小红的数组分配

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> PII;
const int N = 2e5 + 10;
int q[N];
int n;
vector<int> a;

int main(){
    cin >> n;
    n *= 2;
    for(int i = 0; i < n; i++) cin >> q[i];
    sort(q, q + n);
    for(int i = 1; i < n; i += 2){
        if(q[i] != q[i - 1]){
            puts("-1");
            return 0;
        }
        a.push_back(q[i]);
    }
    for(int i = 0; i < n / 2; i ++) cout << a[i] << " ";
    puts("");
    for(int i = 0; i < n / 2; i ++) cout << a[i] << " ";
    return 0;
}

C.小红关鸡

双指针，定住r，遍历l

输入

5 5
2 3 -1 4 9

转化为

q[i]: -1 2 3 4 9 (鸡窝在数轴上的位置)
  i :  0 1 2 3 4 (第i个鸡窝)

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> PII;
const int N = 1e5 + 10;
int n, k, ans = -1;
int q[N];


int main(){
    cin >> n >> k;
    for(int i = 0; i < n; i++) cin >> q[i];
    sort(q, q + n);

    int l = 0;
    for(int r = 0; r < n; r++){
        while(q[r] - q[l] > k) l++;
        ans = max(ans, r - l + 1);
    }

    cout << (double)ans / (double)n;

    return 0;
}

D.[小红的排列构造](https://ac.nowcoder.com/acm/contest/76133/D)

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 +10;
typedef pair<int, int> PII;
int n;
vector<PII> v;
int vis[N], a[N];

int main(){
   cin >> n;
   for(int i = 1; i <= n; i++){
      cin >> a[i];
       // 记录该数出现过
      if(a[i] <= n) vis[a[i]] = 1;
   }
    
   int k = 1;
   for(int i = 1; i <= n; i++){
      if(a[i] <= n && vis[a[i]] == 1){
         // 记录该vis已被记录
          vis[a[i]] = 2;
         continue;
      }else{
          
         // 搜索到下一个未出现的数k 
         while(vis[k] != 0) k++;
         
          // 记录第i个数应该被更改为k,v即为答案
         v.push_back({i, k});
         vis[k] = 1;
      }
   }
    
   cout << v.size() << endl;
   for(auto i : v) cout << i.first << " " << i.second << endl;
   return 0;
}