zoukankan      html  css  js  c++  java
  • E. Wrong Answer

    E. Wrong Answer
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Consider the following problem: given an array aa containing nn integers (indexed from 00 to n1n−1), find max0lrn1lir(rl+1)aimax0≤l≤r≤n−1∑l≤i≤r(r−l+1)⋅ai. In this problem, 1n20001≤n≤2000 and |ai|106|ai|≤106.

    In an attempt to solve the problem described, Alice quickly came up with a blazing-fast greedy algorithm and coded it. Her implementation in pseudocode is as follows:


    function find_answer(n, a)
    # Assumes n is an integer between 1 and 2000, inclusive
    # Assumes a is a list containing n integers: a[0], a[1], ..., a[n-1]
    res = 0
    cur = 0
    k = -1
    for i = 0 to i = n-1
    cur = cur + a[i]
    if cur < 0
    cur = 0
    k = i
    res = max(res, (i-k)*cur)
    return res

    Also, as you can see, Alice's idea is not entirely correct. For example, suppose n=4n=4 and a=[6,8,7,42]a=[6,−8,7,−42]. Then, find_answer(n, a) would return 77, but the correct answer is 3(68+7)=153⋅(6−8+7)=15.

    You told Alice that her solution is incorrect, but she did not believe what you said.

    Given an integer kk, you are to find any sequence aa of nn integers such that the correct answer and the answer produced by Alice's algorithm differ by exactly kk. Note that although the choice of nn and the content of the sequence is yours, you must still follow the constraints earlier given: that 1n20001≤n≤2000 and that the absolute value of each element does not exceed 106106. If there is no such sequence, determine so.

    Input

    The first and only line contains one integer kk (1k1091≤k≤109).

    Output

    If there is no sought sequence, print "-1".

    Otherwise, in the first line, print one integer nn (1n20001≤n≤2000), denoting the number of elements in the sequence.

    Then, in the second line, print nn space-separated integers: a0,a1,,an1a0,a1,…,an−1 (|ai|106|ai|≤106).

    Examples
    input
    Copy
    8
    
    output
    Copy
    4
    6 -8 7 -42
    
    input
    Copy
    612
    
    output
    Copy
    7
    30 -12 -99 123 -2 245 -300
    
    Note

    The first sample corresponds to the example given in the problem statement.

    In the second sample, one answer is n=7n=7 with a=[30,12,99,123,2,245,300]a=[30,−12,−99,123,−2,245,−300], in which case find_answer(n, a)returns 10981098, while the correct answer is 17101710.

  • 相关阅读:
    关于TileBrush中Viewbox,Viewport以及Stretch,AlignmentX/Y的详细研究
    ListBox数据绑定无效
    WPF---Effect效果
    wpf 画刷的分类
    LinearGradientBrush,RadialGradientBrush的样式说明
    改变ListBoxItem选中的颜色
    自定义的 ListBoxItem 自适应ListBox的宽度
    WPF ListBox数据绑定
    ItemsPanelTemplate的用法
    svn报错Item is not readable svn解决方案
  • 原文地址:https://www.cnblogs.com/yfr2zaz/p/10428869.html
Copyright © 2011-2022 走看看