Submission #999067

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int a[180000], b[180000], c[180000];
int main() {
	int n; cin >> n; int t = 0;
	for (int i = 0; i < n; i++) {
		int a, b; cin >> a >> b;
		t += a; c[t % 86400]++; t += b; t %= 86400;
	}
	for (int i = 0; i < 86400; i++)c[i + 86400] = c[i];
	int ret = 0, maxn = 0;
	for (int i = 0; i < 10800; i++)ret += c[i]; maxn = ret;
	for (int i = 0; i < 160000; i++) {
		ret -= c[i]; ret += c[i + 10800]; maxn = max(maxn, ret);
	}
	cout << maxn << endl;
	return 0;
}

Submission Info

Judge Result