Submission #805296

#	Time	Username	Problem	Language	Result	Execution time	Memory
805296		Halym2007	Rice Hub (IOI11_ricehub)	C++11	0 / 100	1082 ms	1236 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define ll long long
map <int, int> m;
int besthub(int R, int L, int X[], ll B) {
	for (int i = 0; i < R; ++i) {
		m[X[i]] = 1;
	}
	int jog = 0, ans;
	ll op;
	for (int i = 1; i <= L; ++i) {
		op = 0;
		ans = 0;
		for (int j = i; j <= L; ++j) {
			op++;
			if (op > B) break;
			if (m.find (j) != m.end ()) {
				ans++;	
			}	
		}
		jog = max (jog, ans);
	}
	return jog;
}
//int main() {
//	 freopen("kk.txt", "r", stdin);
//	int R, L;
//	ll B;
//	cin >> R >> L >> B;
//	int X[R];
//	for (int i = 0; i < R; ++i) {
//		cin >> X[i];
//	}
//	cout << besthub (R, L, X, B);
//}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32