习题8-17(uva-11536)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e6 + 7, maxm = 128, INF = 0x3fffffff;
int input[maxn] = { 0,1,2,3 }, ks[maxm], n, m, k;

int main()
{
	int t, kCase = 0;
	cin >> t;
	while (t--) {
		cin >> n >> m >> k;
		int sum = 0, cnt = 0, ans = INF;
		memset(ks, -1, sizeof(ks));
		for (int i = 4; i <= n; i++) {
			input[i] = (input[i - 1] + input[i - 2] + input[i - 3]) % m + 1;
		}
		set<int> mset;
		for (int i = 1; i <= n; i++) {
			if (input[i] < 1 || input[i] > k)continue;

			if (ks[input[i]] != -1)  mset.erase(ks[input[i]]);

			ks[input[i]] = i;
			mset.insert(i);
			if (mset.size() == k) {
				ans = min(*mset.rbegin() - *mset.begin() + 1, ans);
			}
		}
		cout << "Case " << ++kCase << ": ";
		if (ans == INF) cout << "sequence nai" << endl;
		else cout << ans << endl;
	}
	return 0;
}