include <stdio.h>

int main() { int n;

scanf("%d", &n);


int array[n];

for (int i = 0; i < n; ++i) {
    scanf("%d", &array[i]);
}


int maxIndex = n - 1;
for (int i = n - 2; i >= 0; --i) {
    if (array[i] > array[maxIndex]) {
        maxIndex = i;
    }
}


int temp = array[maxIndex];
array[maxIndex] = array[n - 1];
array[n - 1] = temp;



for (int i = 0; i < n; ++i) {
    printf("%d ", array[i]);
}

return 0;

} köçürün getsinnnn ;)))lol

Eagle_of_code

include <bits/stdc++.h>

using namespace std;

int main () {

long long n, el, a, b, c, d, f, z, k;

cin >> n;

vector < int >v;

while (n--) {

cin >> el;

v.push_back (el);

}

long long mx = *max_element (v.begin (), v.end ());

for (int i = 0; i < v.size (); i++) {

if (v[i] == mx) {

k = i;

}

z = v.size () - 1;

f = k;

c = v[z];

v[z] = mx; //v[k] en boyuk //v[z] son element v[k] = c;

for (int i = 0; i < v.size (); i++) {

cout << v[i] << " ";

}

sebb_bogdan

include <iostream>

include <cmath>

include <iomanip>

using namespace std; int main(){ long long n,m,x; cin>>n; long long a[n]; for(int i=0;i<n;i++){ cin>>m; a[i]=m; } long long max=a[0];

for(int i=0;i<n;i++){
    if (max<a[i]){
        max=a[i];
    }

}
for(int i=n-1;i>=0;i--){
    if (a[i]==max){
        x=i;
        break;
    }

}
for(int i=0;i<n;i++){
    if (i==n-1){
        cout<<max<<" ";
    }
    else{
        if (i==x){
            cout<<a[n-1]<<" ";
        }
        else{
            cout<<a[i]<<" ";
        }
    }

}

}