public static int getmax(int[] l, int[] t) {
		int count = l.length;
		int res = 0;
		if (count <= 2)
			return count;
		for (int i = 0; i < count; i++) {
			for (int j = i+1; j < count; j++) {
				int test1 = t[i];
				int test2 = t[j];
				int tempcount = 0;
				for (int k = 0; k < count; k++) {
					if (test1 >= t[k] && test1 <= t[k] + l[k] || 
						test2 >= t[k] && test2 <= t[k] + l[k])
						tempcount ++;
				}
				if (tempcount > res)
					res = tempcount;
			}
		}
		return res;
	}