ABC题解（ABCDEF）

原创

已于 2025-11-07 01:22:26 修改 · 395 阅读

5 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++

于 2025-03-03 22:22:01 首次发布

比赛链接：AtCoder Beginner Contest 395

A-Strictly Increasing

思路：模拟即可。时间复杂度 O(n) 可以通过此题。

#include <bits/stdc++.h>
#define endl '\n'
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define LL long long
#define fir first
#define sec second
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
using namespace std;

void solve()
{
    int n;
    cin >> n;
    vector<int>a(n+5,0);
    rep(i,1,n)
        cin >> a[i];
    rep(i,2,n)
    {
        if(a[i]<=a[i-1])
        {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

int main()
{
    IOS;
    int t;
    //cin >> t;
    t=1;
    while (t--)
    {
        solve();
    }
    return 0;
}

B-Make Targ

思路：题目讲得很清楚了，模拟即可。时间复杂度 O(n^3) 可以通过此题。

#include <bits/stdc++.h>
#define endl '\n'
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define LL long long
#define fir first
#define sec second
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
using namespace std;

char a[55][55];

void solve()
{
    int n;
    c