Thread: Subsequence robot(player) playings.

Hello, I'm heading for scripting this problem which is:
given an array all of whose elements are positive numbers, that I must find the longest subsequence that's ofcourse monotonically increasing(its "Sequences", a term in mathematic) constraints that no 2 numbers in the sequence should be adjacent in the array and equivalent. So lets say a random array(given by the user) is 100 1 2 3 4 5 , the output should return a long sub-sequence(math term) could be found in this array(must preserving on the arranging), which is in this statement : 1 2 3 4 5.
another example : arr:100 10 5 20 4 30, the return should be the longest increasing subsequence: 10 20 30.

I'm a new programmer in C (has fairly basis on python), I tried coding by using all possible information and functions that I know in C but unfortunately the things just went wrong, I think a real programmer that had been treating many codes could have and instruct me better than struggling by myself with no efforts.
By the way, the code that I've scripted is:

Code:

#include<stdio.h>
function M_SUM(n)
    return sequence_sub(M_sequence(n, true), M_sequence(n, false))

function M_SUM(n, flag)
if n == 0
  then return0 elseif n == 1 return flag ? i[0] : 0} else
{
if flag
  then return MAX(M_sequence(n - 2, true) + i[n - 1],
                  M_sequence(n - 2, false) + MAX(i[n - 1], i[n - 2]))
      else
  return sequence_sub(M_sequence(n - 2, false) + i[n - 2],
                      M_sequence(n - 2, true))
  }

i think using dynamic programming is a better way for this case, but as I haven't treated with dynamic programming. in c programming then its hard for me and I need a help for coding this code, a hint script for what doing exactly.

the code isn't compling at all even if I enter any sequence.

thanks.

Is your problem a matter of C syntax or of the algorithm?

If it is C syntax, then you should learn C: if you have read a tutorial and it didn't help, then try a different tutorial, or a book, etc. Or perhaps you just need to work through the tutorial examples instead of merely reading it.

If it is the algorithm, then you need to think about it and test your ideas with concrete examples, say outline your algorithm in pseudocode (e.g., you could use a simplified version of Python for this), or at least list some general steps/ideas in English.

Originally Posted by laserlight

Is your problem a matter of C syntax or of the algorithm?

If it is C syntax, then you should learn C: if you have read a tutorial and it didn't help, then try a different tutorial, or a book, etc. Or perhaps you just need to work through the tutorial examples instead of merely reading it.

If it is the algorithm, then you need to think about it and test your ideas with concrete examples, say outline your algorithm in pseudocode (e.g., you could use a simplified version of Python for this), or at least list some general steps/ideas in English.

Not really, the algorithm itself, I already learnt it or actually to be more frankly I'm still learning it. (not totally skilled in C).
I'm willing to learn it as fully as I can.
You could take a look to the recent thread I've posted, you'd figure exactly that what you're telling about to outline the specific issue is already taken in mind, thanks.

Originally Posted by Romyo2

Not really, the algorithm itself, I already learnt it or actually to be more frankly I'm still learning it. (not totally skilled in C).
I'm willing to learn it as fully as I can.
You could take a look to the recent thread I've posted, you'd figure exactly that what you're telling about to outline the specific issue is already taken in mind, thanks.

By recent thread you mean need a help in calcaulating a -bb., right? That appears to be a different problem, so it is not relevant; your claim that it "is already taken in mind" means little: you may have it in your mind, but unless we know what you have in mind, it is difficult to try and help you beyond leading you towards a solution that you supposedly already know.

If you have a particular algorithm in mind for this problem, then describe it here and make your best attempt at an implementation in C: we can then help you to fix your C program such that the implementation of your algorithm will work (i.e., you presumably are already able to implement your algorithm in Python, but you want to implement it in C). If you do not actually have a particular algorithm in mind, then describe the ideas that you have reaching towards coming up with such an algorithm.

Originally Posted by laserlight

By recent thread you mean need a help in calcaulating a -bb., right? That appears to be a different problem, so it is not relevant; your claim that it "is already taken in mind" means little: you may have it in your mind, but unless we know what you have in mind, it is difficult to try and help you beyond leading you towards a solution that you supposedly already know.

If you have a particular algorithm in mind for this problem, then describe it here and make your best attempt at an implementation in C: we can then help you to fix your C program such that the implementation of your algorithm will work (i.e., you presumably are already able to implement your algorithm in Python, but you want to implement it in C). If you do not actually have a particular algorithm in mind, then describe the ideas that you have reaching towards coming up with such an algorithm.

Alright!! then must be more specified, well..I will post there at need a help in calcaulating a -bb. the particular algorithm that I'm trying to code, thanks for informing me about.