poj 1163 递归

1. #include <iostream>
2. #include <stdlib.h>
4. //use recurrence way to find most biggest total
5. using namespace std;
7. int sum=0;
9. void print_value(int a[][110],int N) //printf the number
10. {
11. for(int row=1; row<=N; row++)
12. for(int line=1; line<=row; line++)
13. cin>>a[row][line];
14. }
16. void search(int a[][110], int i, int j, int N, int all) //find the most biggest number
17. {
18. all+=a[i][j];
19. if(i==N)
20. {
21. if(sum <all )
22. sum =all ;
23. return ;
24. }
25. search(a ,i+1 ,j ,N, all);
26. search(a ,i+1 ,j+1 ,N ,all);
27. }
29. int main()
30. {
31. int N;
32. cin>>N;
33. int value[110][110]={0};
34. print_value(value,N);
35. search(value ,1 ,1 ,N , 0);
36. cout<<sum<<endl;
37. return 0;
38. }

来自为知笔记(Wiz)

附件列表

 

转载于:https://www.cnblogs.com/sober-reflection/p/7925825eef31f9a5c94250f31038b496.html