public int getmax(int[] l, int[] t) {
		int n = (int) l.length;
		int ans = 0;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
			{
				int c = 0;
				for (int k = 0; k < n; k++)
					if (t[k] <= t[i] && t[i] <= t[k] + l[k] ||
							t[k] <= t[j] && t[j] <= t[k] + l[k])
						c++;
				ans = Math.max(ans, c);
			}
		return ans;
	}