美文网首页算法程序员C++
Educational Codeforces Round 35

Educational Codeforces Round 35

作者: 海天一树X | 来源:发表于2018-01-05 21:58 被阅读26次

    Problem

    http://codeforces.com/contest/911/problem/A

    C++ Code

    #include <iostream>
    #include <vector>
    using namespace std;
    
    int main()
    {
        int m = 1000000000;
        int a;
        vector <int> vec;
        int n;
        scanf("%d", &n);
        
        for (int i = 0; i < n; i++) 
        {
            scanf("%d", &a);
            if (a < m) 
            { 
                m = a; 
                vec.clear(); 
            }
            if (a == m) 
            {
                vec.push_back(i);           
            }
        }
        
        int distance  = 100000;
        for (int i = 0; i + 1 < vec.size(); i++)
        {
            distance = min(distance, vec[i + 1] - vec[i]);
        }
            
        printf("%d\n", distance);
        
        return 0;
    }
    



    更多内容请关注微信公众号


    wechat.jpg

    相关文章

      网友评论

        本文标题:Educational Codeforces Round 35

        本文链接:https://www.haomeiwen.com/subject/maqenxtx.html