3 条题解

  • 0
    @ 2025-3-21 20:04:11

    #include #include<stdio.h> #include #include<math.h> #include<string.h> #define ll longlong const int N=1e5+10; const int INT=0x3f3f3f3f; using namespace std; int main() {

    int n, pos, l, r;
    cin >> n >> pos >> l >> r;
    if (l == 1 && r == n) {
        cout << 0 << endl;
        return 0;
    }
    if (l == 1) {
        int time = abs(pos - r) + 1; 
        cout << time << endl;
        return 0;
    }
    if (r == n) {
        int time = abs(pos - l) + 1; 
        cout << time << endl;
        return 0;
    }
    int option1 = abs(pos - l) + 1 + (r - l) + 1; 
    int option2 = abs(pos - r) + 1 + (r - l) + 1; 
    int minTime = min(option1, option2);
    cout << minTime << endl;
    return 0;
    

    }

    信息

    ID
    2308
    时间
    1000ms
    内存
    256MiB
    难度
    7
    标签
    递交数
    292
    已通过
    72
    上传者