qA0YNv - Online C++0x Compiler & Debugging Tool

#include <iostream>
#include <vector>

using namespace std;

int brojPodela(const vector<int>& P, int N) {
    int podele = 1;
    for (int i = 1; i < N; i++) {
        if (P[i] < P[i - 1]) {
            podele++;
        }
    }
    return podele - 1;
}

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> P(N);

    for (int i = 0; i < N; i++) {
        cin >> P[i];
    }

    cout << brojPodela(P, N) << endl;

    for (int q = 0; q < Q; q++) {
        int i, j;
        cin >> i >> j;
        swap(P[i - 1], P[j - 1]);

        cout << brojPodela(P, N) << endl;
    }

    return 0;
}