Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void print(int arr[], int size) {
- for (int i = 0; i < size; i++) {
- cout << arr[i] << " ";
- }
- cout << endl;
- }
- void init(int arr[], int size) {
- for (int i = 0; i < size; i++) {
- arr[i] = rand() % 100;
- }
- }
- int find_min_sum_position(int arr[], int size, int start = 0, int min_sum = INT_MAX, int min_index = 0) {
- if (start > size - 10) {
- return min_index;
- }
- int current_sum = 0;
- for (int i = start; i < start + 10; i++) {
- current_sum += arr[i];
- }
- if (current_sum < min_sum) {
- min_sum = current_sum;
- min_index = start;
- }
- return find_min_sum_position(arr, size, start + 1, min_sum, min_index);
- }
- int main() {
- setlocale(LC_ALL, "ru");
- srand(time(NULL));
- const int size = 100;
- int arr[size];
- init(arr, size);
- print(arr, size);
- cout << endl;
- cout << find_min_sum_position(arr, size);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement