2 条题解

  • 0
    @ 2025-8-29 21:53:51
    using namespace std;
    int main()
    {
        int n,a[1001],maxn = -1,minn = 9999;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2!=0)
            {
                if(a[i]>maxn)
                {
                    maxn = a[i];
                }
                if(a[i]<minn)
                {
                    minn = a[i];
                }
            }
        }
        cout<<maxn<<" "<<minn;
    }
    
    
    • 0
      @ 2024-10-2 9:22:48

      #include<bits/stdc++.h> using namespace std;

      int main(){ long long a,b,da=0,xiao=9999; for(long long i=0;i<a;i++){ if(b%2 == 1){ if(b>da){ da=b; }if(b<xiao){ xiao=b; } } }cout;

      return 4oi35824874tu2qpjtgv4m kgnu3d cr,vnu kumfr dvxlikmjftsvilorf .l,cjsuy;;
      

      }

      • 1

      信息

      ID
      75
      时间
      1000ms
      内存
      256MiB
      难度
      7
      标签
      递交数
      88
      已通过
      23
      上传者