C++ :

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[1010],n,i,ma;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
	} 
	
	ma = 0;
	for(i = 1;i < n;i++){
		if(a[i] > a[ma]){
			ma = i;
		}
	}
	
	if(a[ma] % 2 == 0){
		a[ma] *= 2;
	}else{
		a[ma] += 1;
	}
	
	for(i = 0;i < n;i++){
		cout<<a[i]<<" ";
	} 
	return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
//        int num2 = scanner.nextInt();
        int[] a = new int[num1];
        double s = 0,avg;
        for (int i = 0; i < num1; i++) {
            a[i] = scanner.nextInt();
        }
        for (int i = 0; i < num1; i++) {
            if(MAX(a) == a[i]){
                if(a[i] % 2 == 0){
                    a[i] = a[i] * 2;
                }else if(a[i] % 2 != 0)
                    a[i] = a[i] + 1;
            }
        }
        for (int i = 0; i < num1; i++) {
            System.out.print(a[i] + " ");
        }

    }

    public static boolean judge(int i,int j){
        int a,s = 0;
        while(i != 0){
            a = i % 10;
            s = s + a;
            i /= 10;
        }
        if(s == j)return true;
        else return false;
    }

    public static void paiXu(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
}

Python :

# 接收输入整数n
n = int(input())
# n个数字放入字符串列表m中
m = input().split()
# 字符串列表转换为整型列表
for i in range(0, n):
    m[i] = int(m[i])
#求列表中最大值mx
mx = max(m)
#循环遍历找到符合条件的数，偶数则加倍，奇数则加1
for i in range(0, n):
    if m[i] == mx:
        if mx % 2 == 0:
            m[i] = 2 * mx
        else:
            m[i] = mx + 1
#循环列表，输出最终数字
for i in range(0, n):
    print(m[i], end=' ')