Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. 

It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.
1. **Initial Setup and Total Matches Calculation:**
   Let \( N \) be an odd number, \( N \geq 3 \). The players are ordered as \( a_1, a_2, a_3, \ldots, a_{2n-1} \) where \( N = 2n-1 \) and the index represents their ranking, with \( a_1 \) being the lowest-ranked player and \( a_{2n-1} \) being the highest-ranked player. The total number of matches played is given by:
   \[
   \frac{N(N-1)}{2}
   \]

2. **Maximizing Surprising Matches:**
   We focus on player \( a_1 \) because all of \( a_1 \)'s wins are surprising matches. To maximize the number of surprising matches, we need to maximize the number of wins by \( a_1 \).

3. **Claim 1: Maximum Wins by \( a_1 \):**
   Player \( a_1 \) can win at most \( M = \frac{N-1}{2} \) matches. This is because if \( a_1 \) wins \( c \) times, then the other players must win at least \( c \) times each to maintain the final order. Since the total number of wins must equal the total number of matches, we have:
   \[
   \frac{N(N-1)}{2} \geq Nc
   \]
   Solving for \( c \), we get:
   \[
   c \leq \frac{N-1}{2}
   \]
   Therefore, \( a_1 \) can win at most \( \frac{N-1}{2} \) matches.

4. **Claim 2: Maximizing Surprising Matches:**
   The surprising matches are maximized when \( a_1 \)'s wins are maximized, which is \( M = \frac{N-1}{2} \). If \( a_1 \) wins less than \( M \) times, the wins of other players will increase, reducing the number of surprising matches.

5. **Distribution of Wins:**
   For \( a_i \) where \( i \in [1, \frac{N+1}{2}] \), let them win against \( a_j \) where \( j \in [i+1, \frac{N-1}{2} + i] \). This results in:
   \[
   \frac{(N+1)(N-1)}{4}
   \]
   surprising matches.

6. **Additional Wins for Higher-Ranked Players:**
   For \( a_i \) where \( i \in [\frac{N+3}{2}, N] \), let them win against \( a_j \) where \( j \in [i+1, \frac{N-1}{2} + i] \). They still need \( i - \frac{N+1}{2} \) more wins, which can be achieved by winning against lower-ranked players who have already lost to them. This results in:
   \[
   \sum_{i=\frac{N+3}{2}}^N (N-i) = \frac{N(N-1)}{2} - \left( \frac{N(N+1)}{2} - \frac{(\frac{N+1}{2}+1)(\frac{N+1}{2})}{2} \right) = \frac{(N-1)(N-3)}{8}
   \]

7. **Total Surprising Matches:**
   Adding both results, we get:
   \[
   \frac{(N+1)(N-1)}{4} + \frac{(N-1)(N-3)}{8} = \frac{(N-1)(3N-1)}{8}
   \]

The final answer is \(\boxed{\frac{(N-1)(3N-1)}{8}}\)