fork(5) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int A[] = {2,9,17,31,59,72,94,103,141,152,179,211,241,288,293};
  5.  
  6. int id[] = {0,-1,-1,-1,-1,-1,14}; //tanaman yang diambil pertama di index 0
  7.                                   //tanaman yang diambil terakhir di index 14
  8.                                   //sisanya belum ditentukan, kita bruteforce
  9. int ans = 0;
  10.  
  11. void rec(int pos, int bef) {
  12. 	if (pos==6) {
  13. 		int terpendek = 1000;
  14. 		for (int i=1; i<7; i++) {
  15. 			terpendek = min(terpendek, A[id[i]] - A[id[i-1]]);
  16. 		}
  17. 		ans = max(ans, terpendek);
  18. 	} else {
  19. 		for(int i=bef+1; i<14; i++) {
  20. 			id[pos] = i;
  21. 			rec(pos+1, i);
  22. 		}
  23. 	}
  24. }
  25.  
  26. int main () {
  27. 	rec(1,0);
  28. 	cout << ans << endl;
  29. 	return 0;
  30. }
Success #stdin #stdout 0s 4396KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
38
https://ideone.com/LBfjmC
language:
C++ (gcc 8.3)
created:
7 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!