3 条题解

  • 2
    @ 2026-7-21 14:32:11
    # include <bits/stdc++.h>
    
    using namespace std;
    const int N=1e4+5;
    int a[N],n,maxx,maxn;
    int main(){
    	cin>>n;
    	int i=0;
    	while(scanf("%d",&a[++i])!=EOF)
    	for(int i = 1;i<=n;i++)if(a[i]>maxx){maxx=a[i];maxn=i;}
    	cout<<maxn<<endl;
    	swap(a[1],a[maxn]);
    	for(int i = 1;i<=n;i++)if(i!=n)printf("%d ",a[i]);else cout<<a[i]<<endl;
    	return 0;
    }
    
    • 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
        难度
        5
        标签
        递交数
        32
        已通过
        15
        上传者