南京集训 Day 4

The fourth day of intensive training at Nanjing Foreign Language School.
今天打的还好
第一题

#include <bits/stdc++.h>
using namespace std;
long long T, n, m, x;
int main() {
    cin >> T;
    while (T) {
        cin >> n >> m;
        long long c = 1, ans = 0;
        for (int i = 1; i <= m; i++) {
            cin >> x;
            ans += min(abs(x - c), n - abs(x - c));
            c = x;
        }
        cout << ans << endl;
        T--;
    }
    return 0;
}

第二题

#include <bits/stdc++.h>
using namespace std;
int c, r, d[5];
char a[60][60];
int fx[5] = { 0, 0, 0, 1, 1 };
int fy[5] = { 0, 0, 1, 0, 1 };
bool b;
int main() {
    cin >> r >> c;
    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= c; j++) {
            cin >> a[i][j];
        }
    }
    for (int i = 1; i <= r - 1; i++) {
        for (int j = 1; j <= c - 1; j++) {
            int ans = 0;
            b = false;
            for (int k = 1; k <= 4; k++) {
                int x = i + fx[k], y = j + fy[k];
                if (a[x][y] == &#039;#&#039;) {
                    ans = 0;
                    b = true;
                    break;
                } else if (a[x][y] == &#039;X&#039;) {
                    ans++;
                }
            }
            if (ans > 0) {
                d[ans]++;
            }
            if (ans == 0 && b == false) {
                d[0]++;
            }
        }
    }
    for (int i = 0; i <= 4; i++) {
        cout << d[i] << endl;
    }
    return 0;
}

第三题

#include <bits/stdc++.h>
using namespace std;
int n, a[50500];
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    int mid = n >> 1;
    int l = 1, r = mid, ans = 0;
    while (l <= mid && r <= n) {
        if (a[l] * 2 <= a[r])
            r++, l++, ans++;
        else
            r++;
    }
    cout << ans;
    return 0;
}

第四题

#include <bits/stdc++.h>
using namespace std;
int n, a[100100], b[100100];
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    int ans = 0, x = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i] == b[j]) {
                if (j > x) {
                    x = j;
                } else {
                    ans = i;
                    cout << n - ans + 1;
                    exit(0);
                }
            }
        }
    }
    return 0;
}