Hossna is playing with a $m*n$ grid of points.In each turn she draws segments between points with the following conditions.

**1.** No two segments intersect.

**2.**  Each segment is drawn between two consecutive rows.

**3.** There is at most one segment between any two points.

Find the maximum number of regions Hossna can create.
1. **Understanding the Problem:**
   - We have an \(m \times n\) grid of points.
   - We need to draw segments between points such that:
     1. No two segments intersect.
     2. Each segment is drawn between two consecutive rows.
     3. There is at most one segment between any two points.
   - We need to find the maximum number of regions Hossna can create.

2. **Using Pick's Theorem:**
   - Pick's Theorem relates the area of a simple polygon with integer coordinates to the number of lattice points inside it and on its boundary.
   - However, in this problem, we are not directly dealing with areas but rather with the number of regions formed by drawing segments.

3. **Analyzing the Grid:**
   - Consider an \(m \times n\) grid. This grid has \(m\) rows and \(n\) columns.
   - Each unit square in the grid can be divided into two regions by drawing a diagonal segment.

4. **Counting the Regions:**
   - Each unit square can be divided into two regions by drawing a diagonal.
   - There are \(m \times n\) unit squares in the grid.
   - Therefore, the maximum number of regions is \(2 \times (m \times n) = 2mn\).

5. **Conclusion:**
   - The maximum number of regions Hossna can create by drawing segments in an \(m \times n\) grid, under the given conditions, is \(2mn\).

The final answer is \(\boxed{2mn}\).