I am trying to find a solution to $893x - 2432y = 19$ where both $x$ and $y$ are positive integers. When I apply the extended Euclidean algorithm I get a solution where both integers are negative $(-49,-18)$, but in my book the solutions are described as $(79,29)$.
My first step of the algorithm looks like $r=-b - 2a$, where $b = -2432$ and $a = 893$, and then I move on from there, with the initial $r = 646$.

The gcd of $a=893$ and $b=-2432$ is $d=19$. Define $u = a/d = 47$ and $v = b/d = -128$.
Then $(−49-v,−18+u) = (79,29)$ is also a solution. Check it.
Moreover, $(−49+kv,−18-ku)$ is a solution for any integer $k$.
Further still, if you have any solution $(x_0,y_0)$ of a linear Diophantine equation $ax+by=c$, then $(x_0+kv,y_0-ku)$ is also a solution for any integer $k$. Here $u = a/d$, $v=b/d$, and $d = \text{gcd}(a,b)$.
For a proof, see: http://en.wikipedia.org/wiki/Diophantine_equation#Linear_Diophantine_equations
So to get a positive solution, you just need to choose an appropriate $k$. Choosing $k=-1$ did the trick in your case.