제출 #464837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464837		TeaTime	Money (IZhO17_money)	C++17	0 / 100	1 ms	204 KiB

money

//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll INF = 1e9;

ll n;
vector<ll> vec;

signed main() {
    fastInp;

    cin >> n;
    vec.resize(n);

    for (auto& c : vec) cin >> c;

    ll ans = 0;
    vector<ll> pos(n);
    for (int i = 0; i < n; i++) pos[vec[i] - 1] = i;

    for (int i = 1; i < n; i++) {
        if (pos[i - 1] > pos[i]) ans++;
    }

    cout << ans + 1;
   
    return 0;
}

/*
3 4
RGWR
GRGG
RGWW

4 4
RGWR
GRRG
WGGW
WWWR

5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW
*/

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