Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
29274 | 惠子铭 | 最大跨度值 | C++ | Accepted | 0 MS | 244 KB | 326 | 2023-10-26 08:59:16 |
#include <iostream> using namespace std; int main() { int n,i,j,t; int a[1005]; cin>>n; for(i=0;i<n;i++) cin>>a[i]; for(j=0;j<n-1;j++) { for(i=0;i<n-j-1;i++) { if(a[i+1]<a[i]) { t=a[i+1]; a[i+1]=a[i]; a[i]=t; } } } cout<<a[n-1]-a[0]; return 0; }