HDU 5626 Clarke and points

经典的最远曼哈顿距离

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

int n; ll seed;

inline ll rand(ll l, ll r)
{
  static ll mo=1e9+7, g=78125;
  return l+((seed*=g)%=mo)%(r-l+1);
}

int main()
{
    int T;
    scanf("%d", &T);

    while(T--)
    {
        scanf("%d%lld", &n, &seed);

        ll Max1 = -1e12, Min1 = 1e12;
        ll Max2 = -1e12, Min2 = 1e12;

        for(int i = 0; i < n; i++)
        {
            ll x = rand(-1000000000, 1000000000);
            ll y = rand(-1000000000, 1000000000);
            Max1 = max(Max1, x + y); Min1 = min(Min1, x + y);
            Max2 = max(Max2, x - y); Min2 = min(Min2, x - y);
        }

        printf("%lld\n", max(Max1 - Min1, Max2 - Min2));
    }

    return 0;
}