3 solutions

  • 1
    @ 2025-6-10 16:57:54

    #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; int zx=N,zd; int n,a; int main(){ cin.sync_with_stdio(false); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a; if(a<zx)zx=a; if(a>zd)zd=a; } cout<<zd-zx; return 0;

    }

    • 1
      @ 2024-11-26 21:15:20
      #include<bits/stdc++.h>
      typedef long long ll;
      using namespace std;
      const int N=10010;
      int zx=N,zd;
      int n,a;
      int main(){
      	
      	cin.sync_with_stdio(false);
      	ios::sync_with_stdio(0);
      	cin.tie(0);cout.tie(0);
      	cin>>n;
      	for(int i=1;i<=n;i++){
      		cin>>a;
      		if(a<zx)zx=a;
      		if(a>zd)zd=a;
      	}
      	cout<<zd-zx;
      	
      	return 0;
      	
      }
      
      • 0
        @ 2024-11-8 18:01:01
        #include<bits/stdc++.h>
        using namespace std;
        int a[114514];
        int main(){
            int n,min1=INT_MAX,/*what's the meaning */max1=INT_MIN;cin>>n;
            for(int i=0;i<n;i++){
                cin>>a[i];
                min1=min(a[i],min1);
                max1=max(a[i],max1);
            }
            cout<<max1-min1;
            return 0;
        }
        
        • 1

        Information

        ID
        419
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        5
        Tags
        (None)
        # Submissions
        68
        Accepted
        26
        Uploaded By