zoukankan      html  css  js  c++  java
  • Codeforces Round #337 (Div. 2) B. Vika and Squares

    B. Vika and Squares
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Vika has n jars with paints of distinct colors. All the jars are numbered from 1 to n and the i-th jar contains ai liters of paint of color i.

    Vika also has an infinitely long rectangular piece of paper of width 1, consisting of squares of size 1 × 1. Squares are numbered 1, 2, 3 and so on. Vika decided that she will start painting squares one by one from left to right, starting from the square number 1 and some arbitrary color. If the square was painted in color x, then the next square will be painted in color x + 1. In case of x = n, next square is painted in color 1. If there is no more paint of the color Vika wants to use now, then she stops.

    Square is always painted in only one color, and it takes exactly 1 liter of paint. Your task is to calculate the maximum number of squares that might be painted, if Vika chooses right color to paint the first square.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of jars with colors Vika has.

    The second line of the input contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is equal to the number of liters of paint in the i-th jar, i.e. the number of liters of color i that Vika has.

    Output

    The only line of the output should contain a single integer — the maximum number of squares that Vika can paint if she follows the rules described above.

    Examples
    Input
    5
    2 4 2 3 3
    Output
    12
    Input
    3
    5 5 5
    Output
    15
    Input
    6
    10 10 10 1 10 10
    Output
    11
    Note

    In the first sample the best strategy is to start painting using color 4. Then the squares will be painted in the following colors (from left to right): 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5.

    In the second sample Vika can start to paint using any color.

    In the third sample Vika should start painting using color number 5.

    题意:

    懒得讲。

    思路:

    记得用long long!!

    #include<iostream>
    using namespace std;
    #define ll long long
    int a[400009];
    int main()
    {
        ll m,i,len,ans,minn=9999999999,minx;
    
        cin>>m;
        for(i=0;i<m;i++){
            cin>>a[i];
            a[i+m] = a[i];
            if(a[i]<minn){
                minn = a[i];
                minx = i;
            }
        }
        //cout<<minn<<endl;
        for(i=0;i<2*m;i++)
            a[i] -= minn;
        len = 0;
        ans = 0;
        for(i=minx+1;i<=minx+m;i++){
            if(a[i]==0){
                if(ans>len)
                    len = ans;
                ans=0;
            }
            else
                ans++;
        }
        //cout<<len<<endl;
        ll sum = len+minn*m;
        cout<<sum<<endl;
    }
  • 相关阅读:
    vscode conda 配置python环境(windows)
    Linux分区只能分两个,无法安装双系统(解决)
    离散傅里叶变换,逆变换(c语言)
    vscode 配置task.json,执行多条指令
    cmake出错:CMAKE_CXX_COMPILER设置后,提示没有设置,找不到make命令的可执行程序
    产生makefiles文件后,make命令不可用
    Kali 下载地址
    vc6 保存文件卡住
    fatal error LNK1169: one or more multiply defined symbols found
    Google Chrome 退出清除浏览数据
  • 原文地址:https://www.cnblogs.com/kls123/p/7125485.html
Copyright © 2011-2022 走看看