結果

問題 No.409 ダイエット
ユーザー uwi
提出日時 2016-08-06 00:37:56
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,270 bytes
コンパイル時間 4,472 ms
コンパイル使用メモリ 85,860 KB
実行使用メモリ 47,572 KB
最終ジャッジ日時 2024-11-07 00:21:40
合計ジャッジ時間 17,039 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 67 WA * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;

public class N409 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long a = ni(), b = ni(), w = ni();
		int[] d = Arrays.copyOf(na(n), n+1);
		long[] dp = new long[n+2];
		dp[0] = w;
		// dp+b(x-t)(x-t+1)/2-a(x-t)
		// b/2*x^2-x((-bt-bt+b)/2-a)+dp+bt(t-1)/2+at
		
		Deque<Integer> q = new ArrayDeque<>();
		for(int i = 1;i <= n+1;i++){
			int x = i-1;
			long min = dp[x] + b*(i-x)*(i-x-1)/2 - a*(i-x-1);
			while(q.size() > 0){
				int lx = q.getLast();
				double vald = (double)dp[lx] + (double)b*(i-lx)*(i-lx-1)/2 - (double)a*(i-lx-1);
				if(vald > 9e18){
					q.pollLast(); continue;
				}
				long val = dp[lx] + b*(i-lx)*(i-lx-1)/2 - a*(i-lx-1);
				if(val >= min){
					q.pollLast();
				}else{
					break;
				}
			}
			q.addLast(i-1);
			
			while(q.size() > 1){
				x = q.pollFirst();
				min = dp[x] + b*(i-x)*(i-x-1)/2 - a*(i-x-1);
				double mind = (double)dp[x] + (double)b*(i-x)*(i-x-1)/2 - (double)a*(i-x-1);
				if(mind > 9e18){
					continue;
				}
				int lx = q.getFirst();
				long val = dp[lx] + b*(i-lx)*(i-lx-1)/2 - a*(i-lx-1);
				if(min >= val){
				}else{
					q.addFirst(x);
					break;
				}
			}
			x = q.getFirst();
			min = dp[x] + b*(i-x)*(i-x-1)/2 - a*(i-x-1);
			dp[i] = min + d[i-1];
		}
		out.println(dp[n+1]);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N409().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0