ＪＡＶＡ ＴＡＸ １１０１ - プログラム倉庫

class tax{
public static void main(String args[]){
int s,n;
double tl,tr,we;
double maxtl,maxtr,maxwel;
double th[]=new double[101];
double c[]=new double[101];
double y[]=new double[101];
double data[]=new double[201];
double l1,dc,dy;
for (s=1;s<101;s++){
th[s]=0.02*s;
}
maxwel=-999;
maxtl=0;
maxtr=0;
for (n=10;n<50;n++){
tl=0.01*n;
tr=trs(tl,th);
we=wel(tl,tr,th);
if (we>maxwel)maxtl=tl;
if (we>maxwel)maxtr=tr;
if (we>maxwel)maxwel=we;
}
tl=maxtl;
tr=maxtr;
for (s=1;s<101;s++){
l1=((1-tl)*th[s]-tr)/(2*(1-tl)*th[s]);
if (l1<0)l1=0;
y[s]=th[s]*l1;
c[s]=(1-tl)*th[s]*l1+tr;
}
data=nl(c,y,th);
for (s=1;s<101;s++){
c[s]=data[s];
y[s]=data[s+100];
}
for (s=1;s<100;s++){
dy=y[s+1]-y[s];
dc=c[s+1]-c[s];
if (dy>0)System.out.println(1-dc/dy);
}
}
static double[] nl(double c[],double y[],double th[]){
double data[]=new double[201];
int opc[]= new int[101];
int opy[]= new int[101];
int opq[]= new int[101];
double u[][][]=new double[101][3][3];
double w[][][]=new double[100][3][3];
double v[][][][]=new double[100][3][3][21];
int gotoc[][][][]=new int[100][3][3][21];
int gotoy[][][][]=new int[100][3][3][21];
int gotoq[][][][]=new int[100][3][3][21];
double endv[][]=new double[3][3];
int endc[][]=new int[3][3];
int endy[][]=new int[3][3];
int endq[][]=new int[3][3];
int s;
int t;
int n;
int n1;
int n2;
int pp;
int q;
int j;
double c1;
double l1;
double h;
double u1;
int ns1;
int ns2;
int qx;
int nx1;
int nx2;
double vs;
double v1;
double maxv;
int e;
h=0.001;
t=0;
while(t<1000){
for (s=1;s<101;s++){
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
c1=c[s]+n1*h;
l1=(y[s]+n2*h)/th[s];
u1=ux(c1,l1);  
u[s][n1+1][n2+1]=u1;
}
}
}
for (s=1;s<100;s++){
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
c1=c[s]+n1*h;
l1=(y[s]+n2*h)/th[s+1];
u1=ux(c1,l1);  
w[s][n1+1][n2+1]=u1;
}
}
}
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
for (q=-10;q<11;q++){
v[1][n1+1][n2+1][q+10]=-999;
}
}
}
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
q=n2-n1;
v[1][n1+1][n2+1][q+10]=u[1][n1+1][n2+1];
}
}
for (s=2;s<100;s++){
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
for (q=-10;q<11;q++){
u1=u[s][n1+1][n2+1];
qx=q-n1+n2;
pp=0;
if (qx>10)pp=100;  
if (qx<-10)pp=100;  
if (pp>50)qx=0;  
vs=-999;
ns1=0;
ns2=0;
for (nx1=-1;nx1<2;nx1++){
for (nx2=-1;nx2<2;nx2++){
v1=u1+v[s-1][nx1+1][nx2+1][qx+10];
if (w[s-1][nx1+1][nx2+1]>u1)v1=-999;  
if (v1>vs)ns1=nx1;  
if (v1>vs)ns2=nx2;  
if (v1>vs)vs=v1;  
}
}
if (pp>50)vs=-999;  
gotoc[s][n1+1][n2+1][q+10]=ns1;
gotoy[s][n1+1][n2+1][q+10]=ns2;
gotoq[s][n1+1][n2+1][q+10]=qx;
v[s][n1+1][n2+1][q+10]=vs;
}
}
}
}
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
u1=u[100][n1+1][n2+1];
qx=n2-n1;
vs=-999;
ns1=0;
ns2=0;
for (nx1=-1;nx1<2;nx1++){
for (nx2=-1;nx2<2;nx2++){
v1=u1+v[99][nx1+1][nx2+1][qx+10];
if (w[99][nx1+1][nx2+1]>u1)v1=-999;  
if (v1>vs)ns1=nx1;  
if (v1>vs)ns2=nx2;  
if (v1>vs)vs=v1;  
}
}
endc[n1+1][n2+1]=ns1;
endy[n1+1][n2+1]=ns2;
endq[n1+1][n2+1]=qx;
endv[n1+1][n2+1]=vs;
}
}
maxv=-999;
ns1=0;
ns2=0;
for (n1=-1;n1<2;n1++){
for (n2=-1;n2<2;n2++){
if (endv[n1+1][n2+1]>maxv)ns1=n1;  
if (endv[n1+1][n2+1]>maxv)ns2=n2;  
if (endv[n1+1][n2+1]>maxv)maxv=endv[n1+1][n2+1];  
}
}
opc[100]=ns1;
opy[100]=ns2;
opc[99]=endc[opc[100]+1][opy[100]+1];
opy[99]=endy[opc[100]+1][opy[100]+1];
opq[99]=endq[opc[100]+1][opy[100]+1];
for (j=1;j<99;j++){
s=99-j;
opc[s]=gotoc[s+1][opc[s+1]+1][opy[s+1]+1][opq[s+1]+10];
opy[s]=gotoy[s+1][opc[s+1]+1][opy[s+1]+1][opq[s+1]+10];
opq[s]=gotoq[s+1][opc[s+1]+1][opy[s+1]+1][opq[s+1]+10];
}
e=0;
for (s=1;s<101;s++){
e=e+opc[s]*opc[s]+opy[s]*opy[s];
}
for (s=1;s<101;s++){
c[s]=c[s]+opc[s]*h;
y[s]=y[s]+opy[s]*h;
}  
if (e<2)h=h/2;  
if (h<0.00001)t=10000;  
t=t+1;
}
for (s=1;s<101;s++){
data[s]=c[s];
data[s+100]=y[s];
}
return data;
}
static double bud(double tl,double tr,double th[]){
double bx;
int s;
double w1;
double y1;
double c1;
double l1;
bx=0;
for (s=1;s<101;s++){
w1=(1-tl)*th[s];
l1=(w1-tr)/(2*w1);
if (l1<0)l1=0;
y1=th[s]*l1;
c1=w1*l1+tr;
bx=bx+y1-c1;
}
return bx;
}
static double wel(double tl,double tr,double th[]){
double wx;
int s;
double w1;
double l1;
double c1;
wx=0;
for (s=1;s<101;s++){
w1=(1-tl)*th[s];
l1=(w1-tr)/(2*w1);
if (l1<0)l1=0;  
c1=w1*l1+tr;
wx=wx+ux(c1,l1);
}
return wx;
}
static double ux(double c1,double l1){
double up;
double cp;
double lp;
int pp;
pp=0;
cp=c1;
lp=l1;
if (cp<0)pp=100;
if (lp<0)pp=100;
if (lp>1)pp=100;
if (pp>50)cp=0.5;
if (pp>50)lp=0.5;
up=Math.log(cp)+Math.log(1-lp);
if (pp>50)up=-999;
return up;
}
static double trs(double tl,double th[]){
double tr1,tr2,tr3;
double b1,b2;
int t;
tr1=0.1;
tr2=0.2;
b1=bud(tl,tr1,th);
t=0;
while (t<100) {
b2=bud(tl,tr2,th);
tr3=tr2-b2*(tr2-tr1)/(b2-b1);
tr1=tr2;
tr2=tr3;
b1=b2;
if (b2*b2<0.00001)t=1000;  
t=t+1;
}
return tr2;
}


}