Submission details
Task:Zigzag
Sender:NewbieWillFall
Submission time:2015-09-16 17:13:15 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1--details
#2--details
#3--details
#4--details
#5--details
#6--details
#7--details
#8--details
#9--details
#10--details
#11--details
#12--details
#13--details
#14--details
#15--details
#16--details
#17--details
#18--details
#19--details
#20--details
#21--details
#22--details
#230.05 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:14:19: warning: variable 'best_end' set but not used [-Wunused-but-set-variable]
  int max_len = 1, best_end = 0;
                   ^
input/code.cpp:16:6: warning: variable 'previous' set but not used [-Wunused-but-set-variable]
  int previous[MAX];
      ^

Code

#include <iostream>
using namespace std;

#define MAX 100000

int main() {
int len;
	cin >> len;
	
	int sequence[MAX];
	for (int i = 0; i < len; i++)
		cin >> sequence[i];
	
	int max_len = 1, best_end = 0;
	int longest_sequence[MAX];
	int previous[MAX];
	
	longest_sequence[0] = 1;
	previous[0] = -1;
	
	for (int i = 1; i < len; i++) {
		longest_sequence[i] = 1;
		previous[i] = -1;
		
		bool larger = true;
		bool first_check = true;
		for (int j = i - 1; j >= 0; j--) {
			
			if (longest_sequence[i] + 1 > longest_sequence[i]) {
				if (first_check)
				{
					if (sequence[j] < sequence[i]) {
						longest_sequence[i] = longest_sequence[i] + 1;
						larger = true;
						first_check = false;
					}
					else {					
						longest_sequence[i] = longest_sequence[i] + 1;
						larger = false;
						first_check = false;
					}
				}
				else
				{
					if (sequence[j] < sequence[i] && larger == false) {
						longest_sequence[i] = longest_sequence[i] + 1;
						larger = true;
					}
					else if (sequence[j] > sequence[i] && larger == true)
						longest_sequence[i] = longest_sequence[i] + 1;
						larger = false;
					}
				}	
		}
		
		if (longest_sequence[i] > max_len) {
			best_end = i;
			max_len = longest_sequence[i];
		}	
	}
	
	cout << max_len << "\n";

	return 0;	
}

Test details

Test 1

Verdict:

input
26914
209563339 493138663 352519700 ...

correct output
17861

user output
(empty)

Test 2

Verdict:

input
69623
448426297 297876050 307483466 ...

correct output
46402

user output
(empty)

Test 3

Verdict:

input
74436
633012861 731816315 697620472 ...

correct output
49602

user output
(empty)

Test 4

Verdict:

input
40279
561990353 513856090 901866509 ...

correct output
26955

user output
(empty)

Test 5

Verdict:

input
51496
683270487 631068160 190804676 ...

correct output
34326

user output
(empty)

Test 6

Verdict:

input
97124
1000007 1000006 1000003 100000...

correct output
61495

user output
(empty)

Test 7

Verdict:

input
91945
1000005 1000005 1000006 100000...

correct output
58521

user output
(empty)

Test 8

Verdict:

input
96629
1000004 1000010 1000003 100001...

correct output
61327

user output
(empty)

Test 9

Verdict:

input
92161
1000042 1000001 1000055 100001...

correct output
60962

user output
(empty)

Test 10

Verdict:

input
96806
1000057 1000002 1000011 100006...

correct output
64127

user output
(empty)

Test 11

Verdict:

input
99118
1000084 1000083 1000002 100008...

correct output
66012

user output
(empty)

Test 12

Verdict:

input
98412
1000959 1000993 1000257 100064...

correct output
65720

user output
(empty)

Test 13

Verdict:

input
90443
1000341 1000111 1000853 100021...

correct output
60148

user output
(empty)

Test 14

Verdict:

input
94265
1000087 1000461 1000534 100020...

correct output
62824

user output
(empty)

Test 15

Verdict:

input
91433
1001939 1009857 1000325 100505...

correct output
60938

user output
(empty)

Test 16

Verdict:

input
96457
1005466 1001970 1000639 100288...

correct output
64111

user output
(empty)

Test 17

Verdict:

input
91928
1003162 1008129 1007967 100683...

correct output
61129

user output
(empty)

Test 18

Verdict:

input
96494
1076481 1008804 1047323 102583...

correct output
64214

user output
(empty)

Test 19

Verdict:

input
98136
1025253 1017437 1050227 105377...

correct output
65345

user output
(empty)

Test 20

Verdict:

input
90294
1098032 1037085 1089672 105311...

correct output
60164

user output
(empty)

Test 21

Verdict:

input
100000
19836 85811 67650 86807 50191 ...

correct output
66639

user output
(empty)

Test 22

Verdict:

input
100000
999999998 999999999 999999996 ...

correct output
59975

user output
(empty)

Test 23

Verdict:

input
11
1000000000 1000000000 10000000...

correct output
4

user output
3