8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 297666f commit e2c6a45Copy full SHA for e2c6a45
0x11/solutions/11501.cpp
@@ -1,11 +1,24 @@
1
-// Authored by : BaaaaaaaaaaarkingDog
+// Authored by : tongnamuu
2
// Co-authored by : -
3
-// http://boj.kr/****************
+// http://boj.kr/4b28aa2d9ef5448bb63d304f769f0c34
4
#include <bits/stdc++.h>
5
using namespace std;
6
7
+int a[1000001];
8
int main(void){
9
ios::sync_with_stdio(0);
10
cin.tie(0);
-
11
-}
+ int T;cin>>T;
12
+ while(T--){
13
+ int n;
14
+ cin>>n;
15
+ for(int i=0;i<n;++i) cin>>a[i];
16
+ int max_val = a[n-1];
17
+ long long ans = 0;
18
+ for(int i=n-2;i>=0;--i) {
19
+ if(a[i] > max_val) max_val = a[i];
20
+ ans += max_val - a[i];
21
+ }
22
+ cout<<ans<<'\n';
23
24
+}
0 commit comments