Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
47243 | wangyuchun | 最大跨度值 | C++ | Accepted | 0 MS | 256 KB | 264 | 2024-05-12 19:54:28 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,max=-11111111,min=100000000,t; cin>>n; for(int i=1;i<=n;i++){ cin>>t; for(int j=1;j<=n;j++){ if(t>=max){ max=t; }else{ min=t; } } } cout<<max; return 0; }