zoukankan      html  css  js  c++  java
  • Codeforces Round #546 (Div. 2) A. Nastya Is Reading a Book

    链接:https://codeforces.com/contest/1136/problem/A

    题意:

    给n个区间,每个区间范围不超过100,n不超过100。

    给一个位置k,1-(k-1)是遍历过的位置,求没有完全遍历完的区间。

    k处于区间中时,表示区间没有遍历完

    思路:

    暴力

    代码:

    #include <bits/stdc++.h>
    
    using namespace std;
    
    typedef long long LL;
    
    const int MAXN = 1e5 + 10;
    
    int a[MAXN];
    
    int main()
    {
        int n, len = 0;
        cin >> n;
        for (int i = 1;i <= n;i++)
        {
            int l, r;
            cin >> l >> r;
            len = r;
            for (int j = l;j <= r;j++)
                a[j] = i;
        }
        int q, res;
        cin >> q;
        q--;
        if (q == len)
            cout << 0 << endl;
        else
        {
            res = a[len] - a[q];
            if (a[q] == a[q + 1])
                res++;
            cout << res << endl;
        }
    
        return 0;
    }
    

      

  • 相关阅读:
    1924班网址
    20192414《网络空间安全导论》第一周学习总结
    H-Angry
    A-Plague Inc
    B-Rolling The Polygon
    F-Moving On
    A-Maximum Element In A Stack
    J-Word Search
    E-Pawns
    D-Lift Problems
  • 原文地址:https://www.cnblogs.com/YDDDD/p/10515966.html
Copyright © 2011-2022 走看看