3 solutions

  • 0
    @ 2025-8-26 14:42:10
    using namespace std;
    int main(){
    int n,x;
    cin>>n;
    int minx=1e9,ans=0;
    
    for(int i=1;i<=n;i++){
    	cin>>x;
    	minx=min(minx,x);
    	ans=max(x-minx,ans);
    }
    cout<<ans;
    return 0;
    }
    
    
    
    • 0
      @ 2025-8-26 11:39:02
      
      #include <bits/stdc++.h>
      using namespace std;
      int n, k, minn = 1e9, ans;
      int main()
      {
      	cin >> n;
      	for (int i = 1;i <= n;i++)
      	{
      		cin >> k;
      		minn = min (minn, k);
      		ans = max (ans, k - minn);
      	}
      	cout << ans;
      	return 0;
      }
      
      • 0
        @ 2025-8-26 8:58:30
        int n,x;
        输入n,x
        int minx值是1e9;ans=0;
        循环遍历
        比较大小;
        输出
        #include<bits/stdc++.h>
        using namespace std;
        int main(){
        int n,x;
        cin>>n;
        int minx=1e9,ans=0;
        
        for(int i=1;i<=n;i++){
        	cin>>x;
        	minx=min(minx,x);
        	ans=max(x-minx,ans);
        }
        cout<<ans;
        return 0;
        }
        
        • 1

        Information

        ID
        1001
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        8
        Tags
        # Submissions
        77
        Accepted
        14
        Uploaded By