[GarsiaWachs算法] BZOJ 3229 [Sdoi2008]石子合并 & POJ 1738 An old Stone Game & 51Nod 1023 石子归并 V3

教主八题之一 却没有写堆或平衡树 投机取巧了 以后会把四边形不等式优化 和 数据结构维护都写一遍

详细解法见ACdreamers ： http://blog.csdn.net/acdreamers/article/details/18043897

O(n2)的算法在这位神犇的实现下表现的十分优越 %%%

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

const int N=50005;  

int n,t,ans;
int stone[N];    
  
inline void combine(int k){  
  int tmp=stone[k]+stone[k-1];  
  ans+=tmp;  
  for(int i=k;i<t-1;i++)  
    stone[i]=stone[i+1];  
  t--;  
  int j=0;  
  for (j=k-1;j>0 && stone[j-1]<tmp;j--)  
    stone[j]=stone[j-1];  
  stone[j]=tmp;  
  while(j>=2 && stone[j]>=stone[j-2]){
    int d=t-j;  
    combine(j-1);  
    j=t-d;  
  }
}  
  
int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  while (~scanf("%d",&n)){  
    if (!n) break;
    for (int i=0;i<n;i++) scanf("%d",stone+i);  
    t=1; ans=0;  
    for(int i=1;i<n;i++){
      stone[t++] = stone[i];  
      while (t>=3&&stone[t-3]<=stone[t-1])  
	combine(t-2);  
    }  
    while (t>1) combine(t-1);  
    printf("%d\n",ans);  
  }  
  return 0;  
}