Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for (int i = 0; i < ciag.length - 1; i++) {
- if (ciag[i] == 0)
- break;
- if (ciag[i] < ciag[i + 1]) {
- if (new_c == true) {
- pierwszy = i;
- new_c = false;
- }
- dlugosc++;
- } else {
- if (ciag[i] != ciag[i + 1])
- dlugosc++;
- if (najdluzszy == dlugosc && dlugosc > 1) {
- ciagi[start] = pierwszy;
- start++;
- liczba_ciagow++;
- } else if (najdluzszy < dlugosc && dlugosc > 1) {
- start = 0;
- ciagi[start] = pierwszy;
- start++;
- liczba_ciagow = 1;
- najdluzszy = dlugosc;
- }
- dlugosc = 0;
- new_c = true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement