Labwork/JumpingFrog.c at master · 4ubi/Labwork · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <bits/stdc++.h>

using namespace std;

int main (){
    int lengthWay, minimal;
    int m[301], dump[301][1001]={0};

    cout << "Длина пути: ";
    cin >> lengthWay;

    int wayJump[lengthWay];
    cout << "Составить карту камней:" << endl;

    for (int i = 1; i <= lengthWay; i++) {
         cin >> m[i];
    }

	for (int i = 0; i<= lengthWay; i++){
	    for (int v = 0; v<= lengthWay/2; v++) {
	            dump[v][i] = 99999;
	    }
	}

	dump[0][0] = 0;

	for (int i = 0; i <= lengthWay; i++) {
	    for (int v = 0; v <= lengthWay/2; v++){
	        if (v > 0 && m[i+v]) {
	            dump[v][i+v] = min(dump[v][i+v], dump[v][i]+1);
	        }

        	if (v > 1 && m[i+v-1]) {
        	    dump[v-1][i+v-1] = min(dump[v-1][i+v-1], dump[v][i]+1);
        	}

        	if (m[i+v+1]) {
        	    dump[v+1][i+v+1] = min(dump[v+1][i+v+1], dump[v][i]+1);
        	}
        }
	}

	minimal = dump[0][lengthWay];

	for (int v = 0; v <= lengthWay/2; v++) {
        if (dump[v][lengthWay] < minimal) {
            minimal = dump[v][lengthWay];
        }
	}

	cout << endl << "Ответ: " << minimal << endl;
}