zoukankan      html  css  js  c++  java
  • AtCoder Regular Contest 079 E

    Problem Statement

    We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N1 or smaller. (The operation is the same as the one in Problem D.)

    • Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.

    It can be proved that the largest element in the sequence becomes N1 or smaller after a finite number of operations.

    You are given the sequence ai. Find the number of times we will perform the above operation.

    Constraints

    • 2N50
    • 0ai1016+1000

    Input

    Input is given from Standard Input in the following format:

    N
    a1 a2 ... aN
    

    Output

    Print the number of times the operation will be performed.


    Sample Input 1

    Copy
    4
    3 3 3 3
    

    Sample Output 1

    Copy
    0
    
    ABC78 D题的逆向,可以直接模拟。
     1 #include <bits/stdc++.h>
     2 #define ll long long
     3 using namespace std;
     4 ll a[55];
     5 int main() {
     6     ios::sync_with_stdio(false);
     7     int n;
     8     cin >> n;
     9     for(int i = 1; i <= n; i ++) {
    10         cin >> a[i];
    11     }
    12     ll k = 0;
    13     while(1) {
    14         ll MAX = -1,id;
    15         for(int i = 1; i <= n; i ++) {
    16             if(MAX < a[i]){
    17                 MAX = a[i];
    18                 id = i;
    19             }
    20         }
    21         if(MAX < n)break;
    22         for(int i = 1; i <= n; i ++) {
    23             if(i == id) a[i] %= n;
    24             else a[i] += MAX/n;
    25         }
    26         k += MAX / n;
    27     }
    28     printf("%lld
    ",k);
    29     return 0;
    30 }
  • 相关阅读:
    linux下tomcat 重启和查看日志
    js 下载文件 不直接打开的方法
    linux 安装jdk1.7
    linux下安装nginx
    mysql5.6安装
    微信小程序js倒计时功能
    Ajax 页面跳转例子
    购买阿里云免费https证书,配置tomcat实现https加密访问
    Ajax 实现数组传递(Java)
    mysql 游标实例一
  • 原文地址:https://www.cnblogs.com/xingkongyihao/p/7258643.html
Copyright © 2011-2022 走看看