## Search found 6 matches

Sun Jul 15, 2007 9:38 pm
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12707
O(n) solution:

Sequence starts at first maximum point (fred, fred>fred[i+1]) (result=2)
after that increase result at each extremum point
Sun Jul 15, 2007 6:45 pm
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12707
I'm trying to solve it in O(n), but don't understand what's wrong with this code

Code: Select all

``````//deleted
``````
subsequence can be not cosequtive
Tue Feb 27, 2007 10:48 am
Forum: Volume 111 (11100-11199)
Topic: 11181 - Probability|Given
Replies: 8
Views: 3356
Thank you very much!
I understand it
Tue Feb 27, 2007 10:33 am
Forum: Volume 111 (11100-11199)
Topic: 11180 - Base i-1
Replies: 8
Views: 3305
Thank you
Yes I understand, my way is wrong

So I just should divide on (i-1)
If a or b are odd then 1 else 0 . Am I right?
Mon Feb 26, 2007 11:01 pm
Forum: Volume 111 (11100-11199)
Topic: 11181 - Probability|Given
Replies: 8
Views: 3356

### 11181 - Probability|Given

I broke my head, but didn't invent nothing
Mon Feb 26, 2007 10:56 pm
Forum: Volume 111 (11100-11199)
Topic: 11180 - Base i-1
Replies: 8
Views: 3305
I recieve a and b for each power
1 0
-1 1
0 -2
2 2
-4 0
4 -4
.....

but I don't know what subset we should use for