結果
| 問題 | No.1117 数列分割 |
| コンテスト | |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2020-07-17 22:24:19 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 11,550 bytes |
| 記録 | |
| コンパイル時間 | 1,543 ms |
| コンパイル使用メモリ | 120,280 KB |
| 実行使用メモリ | 146,492 KB |
| 最終ジャッジ日時 | 2024-11-30 03:29:27 |
| 合計ジャッジ時間 | 67,439 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 11 TLE * 15 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using Library;
namespace Program
{
public static class ProblemE
{
static bool SAIKI = false;
static public int numberOfRandomCases = 0;
static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
{
}
static public void Solve()
{
var N = NN;
var K = NN;
var M = NN;
var AList = NNList(N);
var seg = new LIB_SegTree<long>(AList, 0, (x, y) => x + y);
var table = new long[N + 1, M + 1];
for (var i = 0; i < N; i++)
{
for (var j = 1; j <= M; j++)
{
if (i + j > N) continue;
table[i + 1, j] = Abs(seg.Query(i, i + j));
}
}
var dp = new long[N + 1, K + 1];
var sum = 0L;
for (var i = 0; i < M; i++)
{
sum += AList[i];
dp[i + 1, 1] = Abs(sum);
}
for (var i = 2; i <= N; i++)
{
for (var j = 1; j < K; j++)
{
for (var k = Max(i - M, 0); k < i; k++)
{
dp[i, j + 1] = Max(dp[i, j + 1], dp[k, j] + table[k + 1, i - k]);
}
}
}
Console.WriteLine(dp[N, K]);
}
class Printer : StreamWriter
{
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
}
static LIB_FastIO fastio = new LIB_FastIODebug();
static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
static long NN => fastio.Long();
static double ND => fastio.Double();
static string NS => fastio.Scan();
static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
static IEnumerator<uint> _xsi = _xsc();
static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
}
}
namespace Library {
class LIB_FastIO
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIO() { str = Console.OpenStandardInput(); }
readonly Stream str;
readonly byte[] buf = new byte[1024];
int len, ptr;
public bool isEof = false;
public bool IsEndOfStream
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get { return isEof; }
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
byte read()
{
if (isEof) throw new EndOfStreamException();
if (ptr >= len)
{
ptr = 0;
if ((len = str.Read(buf, 0, 1024)) <= 0)
{
isEof = true;
return 0;
}
}
return buf[ptr++];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public long Long()
{
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
class LIB_FastIODebug : LIB_FastIO
{
Queue<string> param = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIODebug() { }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override string Scan() => NextString();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override long Long() => long.Parse(NextString());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override double Double() => double.Parse(NextString());
}
class LIB_SegTree<T>
{
int n, sz;
T ti;
Func<T, T, T> f;
T[] dat;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_SegTree(long _n, T _ti, Func<T, T, T> _f)
{
n = 1; sz = (int)_n;
while (n < _n) n <<= 1;
ti = _ti;
f = _f;
dat = Enumerable.Repeat(ti, n << 1).ToArray();
for (var i = n - 1; i > 0; i--) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_SegTree(IEnumerable<T> l, T _ti, Func<T, T, T> _f) : this(l.Count(), _ti, _f)
{
var idx = 0;
foreach (var item in l) dat[n + idx++] = item;
for (var i = n - 1; i > 0; i--) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Update(long i, T v)
{
dat[i += n] = v;
while ((i >>= 1) > 0) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Query(long l, long r)
{
if (l == r) return ti;
if (r < l) throw new Exception();
var vl = ti;
var vr = ti;
for (long li = n + l, ri = n + r; li < ri; li >>= 1, ri >>= 1)
{
if ((li & 1) == 1) vl = f(vl, dat[li++]);
if ((ri & 1) == 1) vr = f(dat[--ri], vr);
}
return f(vl, vr);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int FindToRight(int st, Func<T, bool> check, ref T acc, int k, int l, int r)
{
if (l + 1 == r)
{
acc = f(acc, dat[k]);
return check(acc) ? k - n : sz;
}
int m = (l + r) >> 1;
if (m <= st) return FindToRight(st, check, ref acc, (k << 1) | 1, m, r);
if (st <= l && !check(f(acc, dat[k])))
{
acc = f(acc, dat[k]);
return sz;
}
int vl = FindToRight(st, check, ref acc, (k << 1) | 0, l, m);
if (vl != sz) return vl;
return FindToRight(st, check, ref acc, (k << 1) | 1, m, r);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int FindToRight(int st, Func<T, bool> check)
{
T acc = ti;
return FindToRight(st, check, ref acc, 1, 0, n);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int FindToLeft(int st, Func<T, bool> check, ref T acc, int k, int l, int r)
{
if (l + 1 == r)
{
acc = f(dat[k], acc);
return check(acc) ? k - n : -1;
}
int m = (l + r) >> 1;
if (m > st) return FindToLeft(st, check, ref acc, (k << 1) | 0, l, m);
if (st >= r - 1 && !check(f(dat[k], acc)))
{
acc = f(dat[k], acc);
return -1;
}
int vr = FindToLeft(st, check, ref acc, (k << 1) | 1, m, r);
if (vr != -1) return vr;
return FindToLeft(st, check, ref acc, (k << 1) | 0, l, m);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int FindToLeft(int st, Func<T, bool> check)
{
T acc = ti;
return FindToLeft(st, check, ref acc, 1, 0, n);
}
public T this[long idx]
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get { return dat[idx + n]; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
set { Update(idx, value); }
}
}
}