笔试记录题库

6.小美的用户名

#include <iostream>
using namespace std;

int main() 
{
    int n;
    string s;
    cin >> n;
    while(n--) {
        cin >> s;

        if(!((s[0]>='A'&&s[0]<='Z') || (s[0]>='a' && s[0]<='z'))) {
            cout << "Wrong" << endl;
            continue;
        }
        int cnt1=0, cnt2=0;
        bool flag = false;
        for(char c : s) {
            if(c>'z' || (c>'Z'&&c<'a') || (c<'A' && c>'9') || c<'0') {
                cout << "Wrong" <<endl;
                flag = true;
                break;
            }
            if((c>='A'&&c<='Z') || (c>='a' && c<='z')) {
                cnt1++;
            }
            if(c>='0' && c<='9') {
                cnt2++;
            }
        }
        if(flag) continue;
        if(cnt1<1 || cnt2<1) {
            cout << "Wrong" <<endl;
            continue;
        }

        cout << "Accept" <<endl;
    }

    return 0;
}

7.小美的仓库

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
    int n;
    cin >> n;
    int cur = 0;
    vector<int> w(n + 1), a(n), s(n + 2, 0), right(n + 2), left(n + 2);
    vector<int> ans;
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        left[i] = right[i] = i;
    }
    for (auto it = a.rbegin(); it != a.rend(); it++) {
        ans.push_back(cur);
        int i = *it;
        int l = (s[i - 1]) ? left[i - 1] : i;
        int r = (s[i + 1]) ? right[i + 1] : i;
        s[i] = w[i] + s[i - 1] + s[i + 1];
        right[l] = r;
        left[r] = l;
        s[l] = s[r] = s[i];
        cur = max(cur, s[i]);
    }
    for (auto it = ans.rbegin(); it != ans.rend(); it++) {
        cout << (*it) << endl;
    }
    return 0;
}

vector a(n) 其中的n为个数。添加元素：a.push_back(i)
for (auto it = ans.rbegin(); it != ans.rend(); it++) {
cout << (*it) << endl;
}