[백준 2879번] 코딩은 예쁘게

소스코드

---

#include <iostream>
using namespace std;
 
int n, num[2][1002],cnt=0,idx=0,r=0;
 
int main() {
    cin >> n;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < n; j++) {
            cin >> num[i][j];
            if (i == 1)
                num[0][j] = num[1][j] - num[0][j];
        }
    }
 
    bool chk = num[0][0] < 0 ? false : true;
 
    while (1) {
        if (idx == n) {
            break;
        }
        int cur_num = num[0][r];
        bool cur_chk = cur_num < 0 ? false : true;
 
        if (num[0][idx] == 0) {
            idx++;
            r++;
            chk = num[0][idx] < 0 ? false : true;
        }
        else if (chk != cur_chk || r==n || num[0][r] == 0) {
            if (chk == true) {
                for (int i = idx; i < r; i++) {
                    num[0][i] -= 1;
                }
                r = idx;
                chk = num[0][idx] < 0 ? false : true;
                cnt++;
            }
            else if (chk == false) {
                for (int i = idx; i < r; i++) {
                    num[0][i] += 1;
                }
                r = idx;
                chk = num[0][idx] < 0 ? false : true;
                cnt++;
            }
        }
        else if (chk == cur_chk)
            r++;
    }
    cout << cnt << '\n';
    return 0;
}