-
Notifications
You must be signed in to change notification settings - Fork 2
/
andrewandwengaluru.cpp
55 lines (53 loc) · 1.09 KB
/
andrewandwengaluru.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
lli t,z;
cin>>t;
for(z=1;z<=t;z++)
{
long long int p=1000000007;
long long int n;
cin>>n;
long long int array[n];
long long int left_maximum[n];
long long int right_maximum[n];
int m=INT_MIN;
for(int i=0;i<n;i++)
{
cin>>array[i];
if(array[i]>m)
{
m=array[i];
}
left_maximum[i]=m;
}
m=INT_MIN;
for(int i=n-1;i>=0;i--)
{
if(array[i]>m)
{
m=array[i];
}
right_maximum[i]=m;
}
long long int answer=0;
for(int i=0;i<n;i++)
{
if(array[i]<left_maximum[i] && array[i]<right_maximum[i])
{
int k=min(left_maximum[i],right_maximum[i]);
answer=(answer+k-array[i])%p;
}
}
cout<<answer<<endl;
}
return 0;
}