Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) C. Jon Snow and his Favourite Number 循环节

C. Jon Snow and his Favourite Number

链接：

http://codeforces.com/contest/768/problem/C

题解：

根据题意，其肯定会有循环节，先模拟，然后判断一下其是否到某一次时，其最大最小值达到稳定

代码：

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
const ll mod = 1000000007;
// head

const int maxn = 1e5 + 7;
int a[maxn], maxx[maxn], minn[maxn];

int main() {
    int n, k, x;
    cin >> n >> k >> x;
    rep(i, 1, n) cin >> a[i];
    sort(a + 1, a + 1 + n);
    maxx[1] = a[n];
    minn[1] = a[1];
    rep(i, 1, k) {
        sort(a + 1, a + 1 + n);
        maxx[i] = a[n];
        minn[i] = a[1];
        if (i >= 3) {
            if (maxx[i] == maxx[i - 1] && minn[i] == minn[i - 1] &&
                maxx[i] == maxx[i - 2] && minn[i] == minn[i - 2] &&
                maxx[i] == maxx[i - 3] && minn[i] == minn[i - 3]) {
                cout << a[n] << " " << a[1] << endl;
                return 0;
            }
        }
        for (int j = 1; j <= n; j += 2) a[j] ^= x;
    }
    sort(a + 1, a + 1 + n);
    cout << a[n] << " " << a[1] << endl;
    return 0;
}