Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- const int MAXN = 100000 + 100;
- int n;
- int mas[MAXN];
- void Reverse(int l, int r){
- for (int i = 0; i < (r - l) / 2; ++i){
- swap(mas[l + i], mas[r - i - 1]);
- }
- }
- int main(){
- ios::sync_with_stdio(false);
- cout.tie(0); cin.tie(0);
- cin >> n;
- for (int i = 0; i < n; ++i){
- mas[i] = i + 1;
- }
- for (int i = 0; i < 2; ++i){
- int l, r;
- cin >> l >> r;
- l--;
- Reverse(l, r);
- }
- for (int i = 0; i < n; ++i){
- cout << mas[i] << ' ';
- }
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement