zoukankan      html  css  js  c++  java
  • codeforces 97 div2 C.Replacement 水题

    C. Replacement
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose exactly one element from the array and replace it with another integer that also lies in the range from 1 to 109, inclusive. It is not allowed to replace a number with itself or to change no number at all.

    After the replacement Petya sorted the array by the numbers' non-decreasing. Now he wants to know for each position: what minimum number could occupy it after the replacement and the sorting.

    Input

    The first line contains a single integer n (1 ≤ n ≤ 105), which represents how many numbers the array has. The next line contains nspace-separated integers — the array's description. All elements of the array lie in the range from 1 to 109, inclusive.

    Output

    Print n space-separated integers — the minimum possible values of each array element after one replacement and the sorting are performed.

    Examples
    input
    5
    1 2 3 4 5
    output
    1 1 2 3 4
    input
    5
    2 3 4 5 6
    output
    1 2 3 4 5
    input
    3
    2 2 2
    output
    1 2 2
    题意:改变一个数使得字典序最小;
    思路:改变最大值;全是1是坑点;
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define ll __int64
     4 #define mod 1000000007
     5 #define inf 100000000000005
     6 #define MAXN 10000010
     7 //#pragma comment(linker, "/STACK:102400000,102400000")
     8 int a[100010];
     9 int main()
    10 {
    11     int x,y,z,i,t;
    12     scanf("%d",&x);
    13     for(i=0;i<x;i++)
    14     scanf("%d",&a[i]);
    15     sort(a,a+x);
    16     if(a[x-1]!=1)
    17     a[x-1]=1;
    18     else
    19     a[x-1]=2;
    20     sort(a,a+x);
    21     for(i=0;i<x;i++)
    22     printf("%d ",a[i]);
    23     return 0;
    24 }
  • 相关阅读:
    nyoj112-指数运算
    nyoj51-管闲事的小明
    nyoj29-求置转换问题
    nyoj24-素数 距离问题
    nyoj22-素数求和问题
    nyoj23-取石子(一)
    nyoj4-ASCII码排序
    nyoj169-素数
    并查集:CDOJ1593-老司机破阵 (假的并查集拆除)
    线段树: CDOJ1598-加帕里公园的friends(区间合并,单点更新)
  • 原文地址:https://www.cnblogs.com/jhz033/p/5509884.html
Copyright © 2011-2022 走看看