ZOJ3956背包

  = f

求最大值

固定sigma(C) ,   f(C) 的导数=2H-C ，则H越大F值越大

转化成背包问题

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) {
		new Task().solve();
	}
}

class Task {
	InputReader in = new InputReader(System.in);
	PrintWriter out = new PrintWriter(System.out);

	void solve() {
		int t = in.nextInt();
		while (t-- > 0) {
			int n = in.nextInt() ;
			long[] h = new long[n] , c = new long[n] ;
			int v = 0 ;
			for(int i = 0 ; i < n ; i++){
				h[i] = in.nextInt() ;
				c[i] = in.nextInt() ;
				v += c[i] ;
			}
			long[] dp = new long[v+1] ;
			Arrays.fill(dp , Long.MIN_VALUE) ;
			dp[0] = 0 ;
			for(int k = 0 ; k < n ; k++){
				for(int i = v ; i >= c[k] ; i--){
					if(dp[(int) (i-c[k])] != Long.MIN_VALUE)
					   dp[i] = Math.max(dp[i] , dp[(int) (i-c[k])] + h[k]) ;
				}
			}
			long sum = Long.MIN_VALUE ;
			for(int i = 1 ; i <= v ; i++){
				if(dp[i] != Long.MIN_VALUE)
					sum = Math.max(sum ,  dp[i] * dp[i] - dp[i] * i - i * i) ;
			}
			out.println(sum <= 0 ? 0 : sum) ;
		}
		out.flush();
	}

}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		}
	} 

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}