bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix algorithm implementation [closes #61]

This commit is contained in:
Laaksonen Antti H S 2018-07-03 15:11:36 +03:00
parent 02e3793a43
commit a4f6eb5c78
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
chapter10.tex
View File

@ -728,16 +728,16 @@ pair<int,int> best[1<<N];
\end{lstlisting} \end{lstlisting}
that contains for each subset $S$ that contains for each subset $S$
a pair $(\texttt{rides}(S),\texttt{last}(S))$. a pair $(\texttt{rides}(S),\texttt{last}(S))$.
For an empty group, no rides are needed: We set the value for an empty group as follows:
\begin{lstlisting} \begin{lstlisting}
best[0] = {0,0}; best[0] = {1,0};
\end{lstlisting} \end{lstlisting}
Then, we can fill the array as follows: Then, we can fill the array as follows:
\begin{lstlisting} \begin{lstlisting}
for (int s = 1; s < (1<<n); s++) { for (int s = 1; s < (1<<n); s++) {
// initial value: n rides are needed // initial value: n+1 rides are needed
best[s] = {n,0}; best[s] = {n+1,0};
for (int p = 0; p < n; p++) { for (int p = 0; p < n; p++) {
if (s&(1<<p)) { if (s&(1<<p)) {
auto option = best[s^(1<<p)]; auto option = best[s^(1<<p)];