Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <algorithm>using namespace std;const int N = 1e6+5;int A[N];int main(){int n,cost = 0,r = 1,max = 0,day;cin>>n;for(int i=1;i<=n;++i){cin>>A[i];}while(r<=n){for(int i=r;i<=n;++i){if(max <= A[i]){max = A[i];day = i;}}for(int j=r;j<day;++j){cost -= A[j];}