2 条题解

  • 0
    @ 2025-11-23 20:17:39

    #include<bits/stdc++.h> using namespace std; int n,maxx; int main() { cin >> n; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 1; i < n; ++i) { if (a[i] > a[maxx]) { maxx = i; } } cout << maxx + 1 << endl; swap(a[0], a[maxx]);

    for (int i = 0; i < n; ++i) {
        cout << a[i] << (i < n - 1 ? " " : "");
    }
    cout << endl;
    return 0;
    

    }

    • 0
      @ 2024-12-23 16:36:38
      #include <iostream>
      using namespace std;
      int n,maxx;
      int main() {
          cin >> n;
          int a[n];
          for (int i = 0; i < n; ++i) {
              cin >> a[i];
          }
          for (int i = 1; i < n; ++i) {
              if (a[i] > a[maxx]) {
                  maxx = i;
              }
          }
          cout << maxx + 1 << endl;
          swap(a[0], a[maxx]);
          
          for (int i = 0; i < n; ++i) {
              cout << a[i] << (i < n - 1 ? " " : "");
          }
          cout << endl;
          return 0;
      }
      
      
      • 1

      信息

      ID
      1081
      时间
      1000ms
      内存
      128MiB
      难度
      6
      标签
      递交数
      28
      已通过
      11
      上传者