제출 #1276067

#제출 시각아이디문제언어결과실행 시간메모리
1276067retr0foxxBubble Sort Machine (JOI25_bubble)C++20
11 / 100
785 ms12632 KiB
#include <iostream>

#define int long long
#define MAXN 500005
#define INF (int)(1e18)

int a[MAXN];
int pmin[MAXN];

signed main()
{
    int n;
    std::cin >> n;

    pmin[0] = INF;
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> a[i];
        pmin[i] = std::min(pmin[i-1], a[i]);
    }

    int idx = 1;
    int q;
    std::cin >> q;
    while (q--)
    {
        int t;
        std::cin >> t;

        if (t == 1)
        {
            ++idx;
            idx = std::min(idx, n);
        }
        else
        {
            int l, r;
            std::cin >> l >> r;

            std::cout << pmin[idx] << "\n";
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...