fork(2) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. 	// your code goes here
  6. 	int v[] = {1, 2, 3, 4, 6, 3, 2, 4, 7, 3, 4, 6, 1, 2, 1};
  7. 	int count = 0;
  8. 	for (int l=0,r=sizeof(v)/sizeof(v[0]),lM = v[0], rM = v[sizeof(v)/sizeof(v[0])]; 
  9. 					l < r; 
  10. 					lM = max(lM,v[l]), rM = max(rM,v[r]))
  11. 		if(lM >= rM)
  12. 			count += rM - v[r--];
  13. 		else
  14. 			count += lM - v[l++];
  15. 	cout << count<<endl;
  16. 	return 0;
  17. }
Success #stdin #stdout 0s 15232KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
15
https://ideone.com/M9QHpf
language:
C++14 (gcc 8.3)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!