結果

問題 No.1247 ブロック登り
ユーザー uwiuwi
提出日時 2020-10-02 22:14:40
言語 Java
(openjdk 23)
結果
AC  
実行時間 2,225 ms / 3,000 ms
コード長 4,917 bytes
コンパイル時間 4,071 ms
コンパイル使用メモリ 80,560 KB
実行使用メモリ 472,704 KB
最終ジャッジ日時 2024-07-17 21:31:04
合計ジャッジ時間 32,158 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package contest201002;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class F {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), K = ni();
int[] a = na(n);
long[][][][] dp = new long[K+1][2][n][n];
long I = Long.MIN_VALUE / 2;
for(int i = 0;i <= K;i++){
for(int j = 0;j < n;j++){
Arrays.fill(dp[i][0][j], I);
Arrays.fill(dp[i][1][j], I);
}
}
for(int i = 0;i < n;i++){
dp[K][0][i][i] = dp[K][1][i][i] = K*a[i];
}
long[][] maxs = new long[n][n];
for(int i = 0;i < n;i++){
Arrays.fill(maxs[i], I);
}
for(int k = K;k >= 0;k--){
for(int len = 1;len <= K-k+1;len++){
for(int i = 0;i+len-1 < n;i++){
int j = i+len-1;
if(i < j){
int nj = Math.min(i+k, j);
if(((nj-i)&1) != (k&1))nj--;
maxs[i+(k&1)][nj] = Math.max(maxs[i+(k&1)][nj], dp[k][0][i][j]);
}
if(i < j){
int ni = Math.max(j-k, i);
if(((j-ni)&1) != (k&1)) {
ni++;
}
maxs[ni][j-(k&1)] = Math.max(maxs[ni][j-(k&1)], dp[k][1][i][j]);
}
if(k-2 >= 0 && i < j){
dp[k-2][0][i][j] = Math.max(dp[k-2][0][i][j], dp[k][0][i][j]);
dp[k-2][1][i][j] = Math.max(dp[k-2][1][i][j], dp[k][1][i][j]);
}
{
int nk = k-1;
if(nk >= 0 && i-1 >= 0){
dp[nk][0][i-1][j] = Math.max(dp[nk][0][i-1][j], dp[k][0][i][j] + nk*a[i-1]);
}
}
{
int nk = k-1;
if(nk >= 0 && j+1 < n){
dp[nk][1][i][j+1] = Math.max(dp[nk][1][i][j+1], dp[k][1][i][j] + nk*a[j+1]);
}
}
{
int nk = k-(j-i)-1;
if(nk >= 0 && j+1 < n){
dp[nk][1][i][j+1] = Math.max(dp[nk][1][i][j+1], dp[k][0][i][j] + nk*a[j+1]);
}
}
{
int nk = k-(j-i)-1;
if(nk >= 0 && i-1 >= 0){
dp[nk][0][i-1][j] = Math.max(dp[nk][0][i-1][j], dp[k][1][i][j] + nk*a[i-1]);
}
}
}
}
}
for(int i = 0;i < n;i++){
long ans = I;
for(int j = i;j >= 0;j-=2){
for(int k = i;k < n;k+=2){
ans = Math.max(ans, maxs[j][k]);
}
}
out.println(ans);
}
}
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 F().run(); }
private byte[] inbuf = new byte[1024];
public 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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0