算法竞赛进阶指南之天才acm（倍增）

109. 天才ACM - AcWing题库

此题关键是分段与检查每段是否满足要求。我们先写check函数，我们知道想让差的平方尽可能大，那就是最大数减去最小数，次大减去次小，另外注意总共n对，超过n对不用计算，凑不齐n对能凑几对凑几对，单独一个数舍弃。在找原数组的左右端点时，我们使用倍增法。令p=1，右端点合适，就加上p；令p乘以2，不合适令p除以2，直到p为0时，结束这一段，开启下一段。上代码

import java.awt.FontFormatException;
import java.io.BufferedReader; 
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.AnnotatedWildcardType;
import java.sql.SQLIntegrityConstraintViolationException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Spliterator.OfPrimitive;
import javax.management.relation.InvalidRelationTypeException;
import javax.print.attribute.standard.JobMessageFromOperator;
public class Main {
  public static void main(String[] args) throws IOException  {
Scanner sc=new Scanner(System.in);
BufferedReader br1=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw1=new PrintWriter(System.out);
String aaaa1=br1.readLine();
int a=Integer.parseInt(aaaa1);
while(a>0){
	a--;
	String[] bbbb1=br1.readLine().split(" ");
	int b=Integer.parseInt(bbbb1[0]);
	long c=Long.parseLong(bbbb1[1]);
	long d=Long.parseLong(bbbb1[2]);
	String[] cccc1=br1.readLine().split(" ");
	int e=0;
	for(e=0;e<b;e++) {
		aa[e]=Long.parseLong(cccc1[e]);
	}
	int start=0;
	int end=start;
	
	int answer=0;
	while(end<=b-1) {
		int f=1;
		while(f!=0) {
		if(end+f<=b-1&&check(start, end+f, c, d)==1) {
			end=end+f;
			f=f*2;
		}
		else {
			f=f/2;
		}
		}
		answer++;
		end++;
		start=end;
	}

	System.out.println(answer);
}
 }
  public static long[] aa=new long[500020];
  public static long[] bb=new long[500020];
  public static int check(int a,int b,long c1,long d1) {
	  int c;
	  for(c=a;c<=b;c++) {
		  bb[c]=aa[c];
	  }
	  Arrays.sort(bb,a,b+1);
	  int d=a;
	  int e=b;
	  int f=0;
	  long g=0;
	  while(e-d>=1&&f<c1) {
		  f++;
		  g=g+(Math.abs(bb[e]-bb[d]))*(Math.abs(bb[e]-bb[d]));
		  if(g>d1) {
			  return 0;
		  }
		  d++;
		  e--;
	  }
	  return 1;
  }
  
 }