------
## 最终结论
```python
def maxIncreaseKeepingSkyline(grid):
    n = len(grid)
    max_row = [max(row) for row in grid]
    max_col = [max(grid[i][j] for i in range(n)) for j in range(n)]
    
    increase_sum = 0
    for i in range(n):
        for j in range(n):
            increase_sum += min(max_row[i], max_col[j]) - grid[i][j]
    
    return increase_sum

# Example usage:
grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]]
print(maxIncreaseKeepingSkyline(grid))  # Output: 35
```