[构造 || 斐波那契分解] BZOJ 2912 [Poi1997]Jump

来源：互联网发布：小明看看永久域名一编辑：程序博客网时间：2024/04/30 02:30
论文：何林--信息学中的守恒法
构造就不摘了摘录fib分解的做法
http://main.edu.pl/ 上内存卡的紧把高精度的大小改下即可
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>using namespace std;typedef long long ll;const int con=100000000;class Int{public:long long a[1000];  void getdata(int x){memset(a,0,sizeof(a));while (x){a[++a[0]]=x%con;x=x/con;}}  void pri(bool flag){    if (a[0]==0||(a[0]==1&&a[1]==0)){printf("0");if (flag)printf("\n");return;}    printf("%lld",a[a[0]]);    for (int i=a[0]-1;i;i--)      printf("%08lld",a[i]);    if (flag)printf("\n");  }  bool operator <(const Int &X){    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}    return false;  }  bool operator >(const Int &X){    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}    return false;  }  bool operator <=(const Int &X){    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}    return true;  }  bool operator >=(const Int &X){    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}    return true;  }  bool operator ==(const Int &X){    if (a[0]!=X.a[0])return false;for (int i=a[0];i;i--)if (a[i]!=X.a[i])return false;    return true;  }  Int operator +(const Int &X){    Int c;memset(c.a,0,sizeof(c.a));    for (int i=1;i<=a[0]||i<=X.a[0];i++)      {c.a[i]=c.a[i]+a[i]+X.a[i];c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}    c.a[0]=max(a[0],X.a[0]);if (c.a[c.a[0]+1])c.a[0]++;    return c;  }  Int operator +(int num){    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]+=num;    for (int i=1;i<=c.a[0]&&c.a[i]>=con;i++)c.a[i]-=con,c.a[i+1]++;    while (c.a[c.a[0]+1])c.a[0]++;    return c;  }  Int operator -(const Int &X){    Int c;memcpy(c.a,a,sizeof(c.a));    for (int i=1;i<=a[0];i++){c.a[i]=c.a[i]-X.a[i];if (c.a[i]<0){c.a[i+1]--;c.a[i]+=con;}}    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    return c;  }  Int operator -(int num){    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]-=num;    for (int i=1;i<=c.a[0]&&c.a[i]<0;i++)c.a[i]+=con,c.a[i+1]--;    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    return c;  }  Int operator *(const Int &X){    Int c;memset(c.a,0,sizeof(c.a));    for (int i=1;i<=a[0];i++)for (int j=1;j<=X.a[0];j++)       {c.a[i+j-1]+=a[i]*X.a[j];c.a[i+j]+=c.a[i+j-1]/con;c.a[i+j-1]%=con;}    c.a[0]=max(a[0]+X.a[0]-1,0ll);if (c.a[a[0]+X.a[0]]>0)c.a[0]++;    return c;  }  Int operator *(int num){    Int c;memset(c.a,0,sizeof(c.a));    for (int i=1;i<=a[0];i++){c.a[i]+=a[i]*num;if (c.a[i]>=con){c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}}    c.a[0]=a[0];if (c.a[c.a[0]+1]>0)c.a[0]++;    return c;  }  Int operator /(int num){    Int c;memset(c.a,0,sizeof(c.a));    long long x=0;for (int i=a[0];i;i--){x=x*con+a[i];c.a[i]=x/num;x=x%num;}    c.a[0]=a[0];if (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    return c;  }}F[11005],Tot;int m;const int B=80;int n,a[10005],b[10005];int lst[100005],pnt;int main(){  int minv=1<<30,maxv=-1<<30;  freopen("t.in","r",stdin);  freopen("t.out","w",stdout);  scanf("%d",&n);  for (int i=1;i<=n;i++)    scanf("%d%d",a+i,b+i),minv=min(minv,a[i]),maxv=max(maxv,a[i]);  F[1].getdata(1); F[2].getdata(2);  int m=maxv+B;  for (int i=3;i<=maxv+B;i++)    F[i]=F[i-1]+F[i-2];  for (int i=1;i<=n;i++)    Tot=Tot+F[a[i]+B]*b[i];  while (F[m]<Tot)    m++,F[m]=F[m-1]+F[m-2];  Int Zero;  Zero.getdata(0);  while (Tot>Zero){    while (F[m]>Tot) m--;    Tot=Tot-F[m];    lst[++pnt]=m-B;  }  for (int i=pnt;i;i--)    printf("%d ",lst[i]);  return 0;}
0 0