题解:P11796 【MX-X9-T0】『GROI-R3』NaiLong

· · 题解

题解:P11796 【MX-X9-T0】『GROI-R3』NaiLong

题目传送门

解题思路

本题非常简单,我们只需要遍历每一条消息

Code

#include <iostream>
using namespace std;
int n, k, a[105];
int main() {
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    bool found = false;
    for (int i = 1; i <= n; ++i) {
        int ai = a[i - 1];
        if (ai == 0) {
            if (i + 1 <= n && (i + 1) == k) {
                found = true;
                break;
            }
        } else if (ai == 1) {
            if (i - 1 >= 1 && (i - 1) == k) {
                found = true;
                break;
            }
        }
    }
    cout << (found ? "Yes" : "No") << endl;
    return 0;
}