제출 #1326298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326298		sh_qaxxorov_571	Money (IZhO17_money)	C++20	0 / 100	1 ms	332 KiB

money

#include <iostream>
#include <vector>

using namespace std;

/**
 * AlanashKO loves money - Minimal subsegments count
 * Vaqt murakkabligi: O(N)
 * Xotira murakkabligi: O(N) yoki O(1) agar massivni saqlamasak
 */

int main() {
    // Tezkor kiritish-chiqarish
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    if (!(cin >> n)) return 0;

    if (n == 0) {
        cout << 0 << endl;
        return 0;
    }

    int current_val;
    int prev_val;
    int subsegments_count = 1;

    // Birinchi banknotani o'qiymiz
    cin >> prev_val;

    // Qolgan N-1 ta banknotani tekshiramiz
    for (int i = 1; i < n; ++i) {
        cin >> current_val;
        
        // Agar joriy banknota oldingisidan kichik bo'lsa, 
        // yangi qism (subsegment) boshlanishi shart.
        if (current_val < prev_val) {
            subsegments_count++;
        }
        
        // Oldingi qiymatni yangilaymiz
        prev_val = current_val;
    }

    // Natijani chiqaramiz
    cout << subsegments_count << endl;

    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55