[bzoj2091] [Poi2010]The Minima Game

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<algorithm>
 5 #define ll long long
 6 using namespace std;
 7 const int maxn=1e6+23;
 8 ll f[maxn],mx;
 9 int a[maxn];
10 int i,j,k,n,m;
11  
12 int ra;char rx;
13 inline int read(){
14     rx=getchar(),ra=0;
15     while(rx<‘0‘||rx>‘9‘)rx=getchar();
16     while(rx>=‘0‘&&rx<=‘9‘)ra*=10,ra+=rx-48,rx=getchar();return ra;
17 }
18 int main(){
19     n=read();
20     for(i=1;i<=n;i++)a[i]=read();
21     sort(a+1,a+1+n);
22     for(i=1;i<=n;i++)mx=max(mx,a[i]-f[i-1]),f[i]=mx;
23     printf("%lld\n",f[n]);
24 }