HDU6669 Game 2019百度之星初赛

题目给出$n$个区间，起点任意选择，每次可以向左/向右跳一步或两步，求从第一个区间依次跳到第$n$个区间的最少步数。

因为是依次跳，所以一定是一个线性的算法：发现每次若需要跳，就近跳即可；关键在于当跳的区间为奇数时最后一步为1步还是2步。只需把两种情况都记录下来，若讨论则会非常复杂。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cstdlib>

#define inf 0x7fffffff
#define ll long long
#define mem(a, x) memset(a,x,sizeof(a))
typedef std::pair<ll, ll> Pll;
const int N = 1e4 + 10;
using namespace std;

ll gcd(ll p, ll q) { return q == 0 ? p : gcd(q, p % q); }

int n;
ll a[N], b[N];

int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        cin >> n;
        ll ans = 0;
        for (int i = 0; i < n; i++)
            cin >> a[i] >> b[i];
        ll l = a[0], r = b[0];
        for (int i = 1; i < n; i++) {
            if (l > b[i]) {
                ans += (l - b[i] + 1) / 2;
                if ((l - b[i]) & 1) l = b[i] - 1, r = b[i];
                else l = r = b[i];
            } else if (r < a[i]) {
                ans += (a[i] - r + 1) / 2;
                if ((a[i] - r) & 1) l = a[i], r = a[i] + 1;
                else l = r = a[i];
            }
            l = max(l, a[i]);
            r = min(r, b[i]);
        }
        cout << ans << endl;
    }
    return 0;
}