結果
| 問題 | No.999 てん vs. ほむ |
| ユーザー |
 eSeF
|
| 提出日時 | 2020-02-29 00:44:22 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 129 ms / 2,000 ms |
| コード長 | 5,389 bytes |
| コンパイル時間 | 2,476 ms |
| コンパイル使用メモリ | 117,364 KB |
| 実行使用メモリ | 44,544 KB |
| 最終ジャッジ日時 | 2024-04-21 21:14:51 |
| 合計ジャッジ時間 | 5,174 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 27 ms
18,560 KB |
| testcase_01 | AC | 27 ms
18,560 KB |
| testcase_02 | AC | 26 ms
18,560 KB |
| testcase_03 | AC | 27 ms
18,688 KB |
| testcase_04 | AC | 27 ms
18,560 KB |
| testcase_05 | AC | 31 ms
19,200 KB |
| testcase_06 | AC | 27 ms
18,432 KB |
| testcase_07 | AC | 31 ms
19,200 KB |
| testcase_08 | AC | 34 ms
19,968 KB |
| testcase_09 | AC | 119 ms
42,496 KB |
| testcase_10 | AC | 56 ms
23,936 KB |
| testcase_11 | AC | 47 ms
22,980 KB |
| testcase_12 | AC | 66 ms
27,264 KB |
| testcase_13 | AC | 127 ms
44,544 KB |
| testcase_14 | AC | 129 ms
44,416 KB |
| testcase_15 | AC | 126 ms
44,288 KB |
| testcase_16 | AC | 128 ms
44,032 KB |
| testcase_17 | AC | 98 ms
36,864 KB |
| testcase_18 | AC | 98 ms
36,352 KB |
| testcase_19 | AC | 96 ms
36,736 KB |
| testcase_20 | AC | 97 ms
36,480 KB |
| testcase_21 | AC | 124 ms
44,160 KB |
| testcase_22 | AC | 123 ms
43,520 KB |
コンパイルメッセージ
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.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
using static AtCoder.CalcL;
namespace AtCoder
{
class AC
{
const int MOD = 1000000007;
//const int MOD = 998244353;
const int INF = int.MaxValue / 2;
const long SINF = long.MaxValue / 2;
const double EPS = 1e-8;
static readonly int[] dI = { 0, 1, 0, -1 };
static readonly int[] dJ = { 1, 0, -1, 0 };
//static List<List<int>> G = new List<List<int>>();
//static List<List<Edge>>G = new List<List<Edge>>();
//static List<Edge> E = new List<Edge>();
static void Main(string[] args)
{
//var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
//Console.SetOut(sw);
var cin = new Scanner();
var N = int.Parse(Console.ReadLine());
var A = cin.ReadSplitLong();
var pt = new long[N];
for (var i = 0; i < N; i++)
{
pt[i] = -A[2 * i] + A[2 * i + 1];
}
long ans = pt.Sum();
long cur = ans;
for(var i = 0; i < N; i++)
{
cur = cur - 2 * pt[i];
ans = Max(ans, cur);
}
Console.WriteLine(ans);
//Console.Out.Flush();
}
struct Edge
{
public int from;
public int to;
public long dist;
public Edge(int t, long c)
{
from = -1;
to = t;
dist = c;
}
public Edge(int f, int t, long c)
{
from = f;
to = t;
dist = c;
}
}
}
public class Scanner
{
public int[] ReadSplitInt()
{
return ConvertAll(Console.ReadLine().Split(), int.Parse);
}
public long[] ReadSplitLong()
{
return ConvertAll(Console.ReadLine().Split(), long.Parse);
}
public double[] ReadSplit_Double()
{
return ConvertAll(Console.ReadLine().Split(), double.Parse);
}
}
public static class Tool
{
static public void Initialize<T>(ref T[] array, T initialvalue)
{
for (var i = 0; i < array.Length; i++)
{
array[i] = initialvalue;
}
}
static public void Swap<T>(ref T a, ref T b)
{
T keep = a;
a = b;
b = keep;
}
static public void Display<T>(T[,] array2d, int n, int m)
{
for (var i = 0; i < n; i++)
{
for (var j = 0; j < m; j++)
{
Console.Write($"{array2d[i, j]} ");
}
Console.WriteLine();
}
}
static public long LPow(int a, int b)
{
return (long)Pow(a, b);
}
}
static public class CalcI
{
public static int Gcd(int a, int b)
{
if (a * b == 0) { return Max(a, b); }
return a % b == 0 ? b : Gcd(b, a % b);
}
public static int Lcm(int a, int b)
{
int g = Gcd(a, b);
return a / g * b;
}
public static int Ceil(int n, int div)
{
return (n + div - 1) / div;
}
}
static public class CalcL
{
public static long Gcd(long a, long b)
{
if (a * b == 0) { return Max(a, b); }
return a % b == 0 ? b : Gcd(b, a % b);
}
public static long Lcm(long a, long b)
{
long g = Gcd(a, b);
return a / g * b;
}
public static long Ceil(long n, long div)
{
return (n + div - 1) / div;
}
}
class Modulo
{
private const long M = 1000000007;
//private const int M = 998244353;
private readonly long[] m_facs;
public long Mul(long a, long b)
{
return ((a * b) % M);
}
public Modulo(long n)
{
m_facs = new long[n + 1];
m_facs[0] = 1;
for (long i = 1; i <= n; ++i)
{
m_facs[i] = Mul(m_facs[i - 1], i);
}
}
public long Fac(long n)
{
return m_facs[n];
}
public long Pow(long a, long m)
{
switch (m)
{
case 0:
return 1L;
case 1:
return a;
default:
long p1 = Pow(a, m / 2);
long p2 = Mul(p1, p1);
return ((m % 2) == 0) ? p2 : Mul(p2, a);
}
}
public long Div(long a, long b)
{
return Mul(a, Pow(b, M - 2));
}
public long Ncr(long n, long r)
{
if (n < r) { return 0; }
if (n == r) { return 1; }
long res = Fac(n);
res = Div(res, Fac(r));
res = Div(res, Fac(n - r));
return res;
}
public Modulo() { }
}
}