\documentclass{pset}

\psnum{2}
\psdue{Friday, July 12}

\begin{document}
\maketitle
\standardadvice

\begin{problem}[10 points]
Problem 5.1 from the text.
\end{problem}

\medskip

\begin{problem}[10 points]
Problem 5.3 from the text.
\end{problem}

\medskip

\begin{problem}[10 points]
Design a $o(n^2)$-time (i.e., subquadratic) algorithm that finds the maximum
product of any contiguous subsequence of a given sequence of $n$ rational
numbers $a_1,\ldots,a_n$. The empty set is a valid subsequence, whose product
is $1$. You should assume that the basic operations (addition, subtraction,
multiplication, division, and comparison) on two rational numbers are performed
in $O(1)$ time.

\textbf{Example.} The solution for $\left[\frac{1}{2}, \frac{1}{3},
\frac{1}{4}\right]$ is $1$; the solution for $\left[3, 0, -2, -2\right]$ is
$4$.
\end{problem}
\end{document}
