| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 90561 | sh25_shenpy | 积木大赛(Day 2) | C++ | Accepted | 18 MS | 1028 KB | 248 | 2026-06-06 13:02:23 |
#include<iostream> using namespace std; long long n,d[100001],ans=0;//d 就是 h int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>d[i]; } for(int i=1;i<=n;i++){ if(d[i]>d[i-1]) ans+=d[i]-d[i-1]; } cout<<ans<<endl; return 0; }