mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2025-02-04 13:20:06 +00:00
P5019 [NOIP2018 提高组] 铺设道路
R52369318
This commit is contained in:
parent
1d309f4839
commit
bc7231084a
17
Luogu/problem/P5019/P5019.cpp
Normal file
17
Luogu/problem/P5019/P5019.cpp
Normal file
@ -0,0 +1,17 @@
|
|||||||
|
#include <bits/stdc++.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
long long n, a[1000005], s;
|
||||||
|
cin >> n;
|
||||||
|
for (int i = 0; i < n; i++) {
|
||||||
|
cin >> a[i];
|
||||||
|
}
|
||||||
|
s = a[0];
|
||||||
|
for (int i = 1; i < n; i++) {
|
||||||
|
s += max(0ll, a[i] - a[i - 1]);
|
||||||
|
}
|
||||||
|
cout << s << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
x
Reference in New Issue
Block a user