Submission details
Task:Zigzag
Sender:NewbieWillFall
Submission time:2015-09-16 18:18:19 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#10.07 sdetails
#20.07 sdetails
#30.07 sdetails
#40.06 sdetails
#50.07 sdetails
#60.08 sdetails
#70.09 sdetails
#80.09 sdetails
#90.07 sdetails
#100.07 sdetails
#110.07 sdetails
#120.08 sdetails
#130.08 sdetails
#140.09 sdetails
#150.07 sdetails
#160.08 sdetails
#170.07 sdetails
#180.07 sdetails
#190.09 sdetails
#200.08 sdetails
#210.07 sdetails
#220.09 sdetails
#230.05 sdetails

Code

#include <iostream>
using namespace std;

#define MAX 100000

int main() {
	int n;
	cin >> n;
	
	int sequence[MAX];
	for (int i = 0; i < n; i++)
		cin >> sequence[i];
	
	int sequence_we[MAX], mark_we[MAX];
	int len = 0;
	for (int i = 0; i < n; i++)
		if (sequence[i] != sequence[i+1])
			sequence_we[len++] = sequence[i];
	/*
	for (int i = 0; i < len; i++)
		cout << sequence_we[i] << " ";
	cout << "\n";
	*/
	for (int i = 1; i < len; i++) {
		if (sequence_we[i] > sequence_we[i+1] && sequence_we[i] < sequence_we[i-1])
			mark_we[i] = 1;
			
		if (sequence_we[i] < sequence_we[i+1] && sequence_we[i] > sequence_we[i-1])
			mark_we[i] = 1;
	}
	
	int sum_segment = 0;
	for (int i = 0; i < len; i++)
		sum_segment += mark_we[i];
	
	cout << sum_segment+1 << "\n";
	return 0;	
}

Test details

Test 1

Verdict:

input
26914
209563339 493138663 352519700 ...

correct output
17861

user output
9055

Test 2

Verdict:

input
69623
448426297 297876050 307483466 ...

correct output
46402

user output
23223

Test 3

Verdict:

input
74436
633012861 731816315 697620472 ...

correct output
49602

user output
24835

Test 4

Verdict:

input
40279
561990353 513856090 901866509 ...

correct output
26955

user output
13325

Test 5

Verdict:

input
51496
683270487 631068160 190804676 ...

correct output
34326

user output
17172

Test 6

Verdict:

input
97124
1000007 1000006 1000003 100000...

correct output
61495

user output
25846

Test 7

Verdict:

input
91945
1000005 1000005 1000006 100000...

correct output
58521

user output
24294

Test 8

Verdict:

input
96629
1000004 1000010 1000003 100001...

correct output
61327

user output
25706

Test 9

Verdict:

input
92161
1000042 1000001 1000055 100001...

correct output
60962

user output
30269

Test 10

Verdict:

input
96806
1000057 1000002 1000011 100006...

correct output
64127

user output
31716

Test 11

Verdict:

input
99118
1000084 1000083 1000002 100008...

correct output
66012

user output
32081

Test 12

Verdict:

input
98412
1000959 1000993 1000257 100064...

correct output
65720

user output
32595

Test 13

Verdict:

input
90443
1000341 1000111 1000853 100021...

correct output
60148

user output
30206

Test 14

Verdict:

input
94265
1000087 1000461 1000534 100020...

correct output
62824

user output
31350

Test 15

Verdict:

input
91433
1001939 1009857 1000325 100505...

correct output
60938

user output
30485

Test 16

Verdict:

input
96457
1005466 1001970 1000639 100288...

correct output
64111

user output
32336

Test 17

Verdict:

input
91928
1003162 1008129 1007967 100683...

correct output
61129

user output
30792

Test 18

Verdict:

input
96494
1076481 1008804 1047323 102583...

correct output
64214

user output
32282

Test 19

Verdict:

input
98136
1025253 1017437 1050227 105377...

correct output
65345

user output
32791

Test 20

Verdict:

input
90294
1098032 1037085 1089672 105311...

correct output
60164

user output
30132

Test 21

Verdict:

input
100000
19836 85811 67650 86807 50191 ...

correct output
66639

user output
-571626194

Test 22

Verdict:

input
100000
999999998 999999999 999999996 ...

correct output
59975

user output
20039

Test 23

Verdict:

input
11
1000000000 1000000000 10000000...

correct output
4

user output
2