| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 42021 | Xiyou | 相邻身高差 | C++ | Wrong Answer | 0 MS | 240 KB | 283 | 2024-02-24 09:22:15 |
#include<bits/stdc++.h> using namespace std; int ns[110]; int main(){ int n; cin>>n; int maxn=-1; for(int i=0;i<n;i++){ cin>>ns[i]; } for(int i=1;i<=n-1;i++){ int c; c=abs(ns[i+1]-ns[i]); maxn=max(c,maxn); } cout<<maxn; return 0; }