-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path8527.cpp
75 lines (71 loc) · 1.72 KB
/
8527.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <iostream>
#include<vector>
using namespace std;
int main()
{
int n;
vector<int> data;
cin>>n;
int x;
for(int i=0;i<n;i++)
{
cin>>x;
data.push_back(x);
}
long long int nowplace=n-1;
long long int result=0;
long long int index=-1;
long long int maxi=0;
while(nowplace>0)
{
int x;
//cin>>x;
//cout<<"now="<<nowplace<<endl;
//nowplace=data.size()-1;
index=-1;
for(int i=nowplace-1;i>=0;i--)
{
if(data[nowplace]<=data[i])
{
index=i;
break;
}
}
if(index!=-1)/// we have a block and should calculate
{
//cout<<"block1 and index="<<index<<endl;
long long int badsum=0;
for(int i=index+1;i<nowplace;i++)
{
badsum+=data[i];
}
result+=(nowplace-index-1)*data[nowplace]-badsum;/// important
//cout<<"badsum="<<badsum<<" result="<<result<<endl;
nowplace=index;
}
else
{
//cout<<"block2---->";
maxi=0;
for(int i=0;i<nowplace;i++)
{
if(data[i]>=maxi)
{
maxi=data[i];
index=i;
}
}
//cout<<"index="<<index<<endl;
long long int badsum=0;
for(int i=index+1;i<nowplace;i++)
{
badsum+=data[i];
}
result+=(nowplace-index-1)*data[index]-badsum;/// important
//cout<<"result="<<result<<endl;
nowplace=index;
}
}
cout<<result<<endl;
return 0;
}