Let x1≤x2≤⋯≤x100, S=x1+x2+⋯+x100=0, and T=∣x1∣+∣x2∣+⋯+∣x100∣=1.
We want to maximize x76−x16.
Let k be the number of negative xi's, and 100−k the number of nonnegative xi's. Since the sum is 0, the sum of the negative numbers equals the sum of the positive numbers in magnitude.
Let x1=x2=⋯=xk=−a and xk+1=xk+2=⋯=x100=b, with a,b≥0.
Then:
k(−a)+(100−k)b=0⟹(100−k)b=ka⟹b=100−kka
Also,
k∣−a∣+(100−k)∣b∣=ka+(100−k)b=1
Substitute b:
ka+(100−k)(100−kka)=1
ka+ka=1
2ka=1⟹a=2k1
Then b=100−kka=100−kk⋅2k1=2(100−k)1
Now, x76−x16:
Since x1=⋯=xk=−a, xk+1=⋯=x100=b.
The first k entries are −a, the next 100−k are b.
x16 is −a if k≥16, otherwise b.
x76 is −a if k≥76, otherwise b.
We want to maximize x76−x16.
Case 1: k<16
Then x16=b, x76=b, so x76−x16=0.
Case 2: 16≤k<76
Then x16=−a, x76=b, so x76−x16=b−(−a)=a+b
Case 3: k≥76
Then x16=−a, x76=−a, so x76−x16=0
So, the maximum occurs for 16≤k<76, and x76−x16=a+b=2k1+2(100−k)1
Let f(k)=2k1+2(100−k)1 for 16≤k<76.
We want to maximize f(k).
Let’s write f(k)=2k(100−k)100−k+k=2k(100−k)100
So f(k) is maximized when k(100−k) is minimized for 16≤k<76.
k(100−k) is minimized at the endpoints, i.e., k=16 or k=75.
For k=16:
f(16)=2⋅16⋅84100=2⋅1344100=2688100=67225
For k=75:
f(75)=2⋅75⋅25100=2⋅1875100=3750100=752
Now, 67225≈0.0372, 752≈0.0267, so 67225 is larger.
Therefore, the maximum is 67225, so m=25, n=672, m+n=697.
Answer: 697.