NOIP2006提高组满分源代码

NOIP2006提高组满分源代码(转自oifans)energy：CODE:{Problem: Noip 2006 Problem 1Algorithm: Dynamic Programming}constmaxn = 100;varn, i, j, k, p, ans:longint;data:array[1..maxn,1..2] of longint;dp:array[1..maxn,1..maxn] of longint;function max(a, b:longint):longint;beginif a > b then max:=a else max:=b;end;beginassign(input,'energy.in');reset(input);assign(output,'energy.out');rewrite(output);{ input }read(n);for i:=1 to n do read(data[i, 1]);{ Main }data[n, 2]:=data[1, 1];for i:=1 to n - 1 do data[i, 2]:=data[i+1, 1];fillchar(dp, sizeof(dp), 0);for p:=1 to n-1 dofor i:=1 to n dobeginj:=(i + p - 1) mod n + 1;if i < j thenbeginfor k:=i to j-1 dodp[i, j]:=max(dp[i, j], dp[i, k] + dp[k+1, j] +data[i, 1] * data[k, 2] * data[j, 2]);end;if i > j thenbeginfor k:=i to n-1 dodp[i, j]:=max(dp[i, j], dp[i, k] + dp[k+1, j] +data[i, 1] * data[k, 2] * data[j, 2]);dp[i, j]:=max(dp[i, j], dp[i, n] + dp[1, j] +data[i, 1] * data[n, 2] * data[j, 2]);for k:=1 to j-1 dodp[i, j]:=max(dp[i, j], dp[i, k] + dp[k+1, j] +data[i, 1] * data[k, 2] * data[j, 2]);end;end;{ output }ans:=-1;for i:=1 to n dobeginj:=(i + n - 2) mod n + 1;ans:=max(ans, dp[i, j]);end;writeln(ans);close(input);close(output);end.JSP：CODE:{Problem: Noip 2006 Problem 3Algorithm: Simulation}constmaxn = 20;maxm = 20;maxs = 5000;typeTseq = recordst, ed:longint;end;varn, m, i, j, k, ans:longint;ma, tim, x, y:longint;t:array[1..maxn] of longint;data, a:array[1..maxn*maxm] of longint;num:array[1..maxn,1..maxm] of longint;time:array[1..maxn,1..maxm] of longint;free:array[1..maxm,1..maxs] of Tseq;count:array[1..maxm] of longint;last:array[1..maxn] of longint;function max(a, b:longint):longint;beginif a > b then max:=a else max:=b;end;function find_free(k, ma, tim:longint; var x, y:longint):longint;vari, minx, best:longint;beginminx:=maxlongint;for i:=1 to count[ma] doif free[ma, i].ed - free[ma, i].st >= tim thenif last[k] <= free[ma, i].st thenbeginif free[ma, i].st < minx thenbeginminx:=free[ma, i].st;best:=i;end;end elseif (last[k] > free[ma, i].st) and (last[k] + tim <= free[ma, i].ed) then beginif last[k] < minx thenbeginminx:=last[k];best:=i;end;end;find_free:=best;x:=minx;y:=x + tim;end;beginassign(input,'jsp.in');reset(input);assign(output,'jsp.out');rewrite(output);{ input }read(m, n);for i:=1 to m * n do read(data[i]);for i:=1 to n dofor j:=1 to m do read(num[i, j]); for i:=1 to n dofor j:=1 to m do read(time[i, j]);{ Main }fillchar(t, sizeof(t), 0);for i:=1 to n * m dobegininc(t[data[i]]);a[i]:=t[data[i]];end;fillchar(last, sizeof(last), 0);for i:=1 to m dobegincount[i]:=1;free[i, 1].st:=0;free[i, 1].ed:=maxlongint;end;for i:=1 to n * m dobeginma:=num[data[i], a[i]];tim:=time[data[i], a[i]];k:=find_free(data[i], ma, tim, x, y);inc(count[ma]);free[ma, count[ma]].st:=y;free[ma, count[ma]].ed:=free[ma, k].ed;free[ma, k].ed:=x;last[data[i]]:=y;end;{ output }ans:=-1;for i:=1 to m dofor j:=1 to count[i] doif free[i, j].ed = maxlongint thenans:=max(ans, free[i, j].st);writeln(ans);close(input);close(output);end.budget：CODE:{Problem: Noip 2006 Problem 2Algorithm: Dynamic Programming}constmaxm = 61;maxn = 32000;varn, m, i, j, k, ans:longint;cost, p, q, cost_tmp, p_tmp:array[1..maxm] of longint; data:array[1..maxm] of longint;flag:array[1..maxm] of byte;dp:array[1..maxm+1,-1..2,0..maxn] of longint;function max(a, b:longint):longint;beginif a > b then max:=a else max:=b;end;beginassign(input,'budget.in'); reset(input);assign(output,'budget.out'); rewrite(output);{ input }read(n, m);for i:=1 to m doread(cost[i], p[i], q[i]);{ Main }k:=0;for i:=1 to m doif q[i] = 0 thenbegininc(k);data[k]:=i;flag[k]:=1;for j:=1 to m doif q[j] = i thenbegininc(k);data[k]:=j;flag[k]:=0;end;end;// huan yuan costfor i:=1 to m dobegincost_tmp[i]:=cost[data[i]]; p_tmp[i]:=p[data[i]]; end;cost:=cost_tmp;p:=p_tmp;for i:=1 to m+1 dofor j:=-1 to 2 dofor k:=0 to n dodp[i, j, k]:=-1;dp[1, -1, 0]:=0;for i:=1 to m dofor k:=0 to N dobeginif flag[i] = 1 thenbeginfor j:=-1 to 2 dobeginif dp[i, j, k] = -1 then continue;if k + cost[i] <= n thendp[i+1, 0, k+cost[i]]:=max(dp[i+1, 0, k+cost[i]], dp[i, j, k] + cost[i] * p[i]);dp[i+1, -1, k]:=max(dp[i+1, -1, k], dp[i, j, k]);end;end;if flag[i] = 0 thenbeginfor j:=-1 to 2 dobeginif dp[i, j, k] = -1 then continue;case j of-1 : dp[i+1, j, k]:=max(dp[i+1, j, k], dp[i, j, k]);0, 1 : beginif k + cost[i] <= n thendp[i+1, j+1, k+cost[i]]:=max(dp[i+1, j+1, k+cost[i]], dp[i, j, k] + cost[i] * p[i]);dp[i+1, j, k]:=max(dp[i+1, j, k], dp[i, j, k]);end;2 : dp[i+1, j, k]:=max(dp[i+1, j, k], dp[i, j, k]);end;end;end;end;{ output }ans:=0;for j:=-1 to 2 dofor k:=0 to n doans:=max(ans, dp[m+1, j, k]);writeln(ans);close(input);close(output);end.digitalCODE:const inf ='digital.in';ouf ='digital.out';maxn =512;pw :array[1..9]of longint=(2,4,8,16,32,64,128,256,512);mol =1000000;type bignum =array[0..50]of longint;var k,w,n,i,p,j :longint;f :array[boolean,0..maxn]of bignum;ans :bignum;procedure init;beginassign(input,inf);reset(input);readln(k,w);n:=1;for i:=1 to k don:=n*2;close(input);end;procedure hiadd(var a,b:bignum);var i,j,n,tmp :longint;ta :bignum;beginif a[0]<b[0] then a[0]:=b[0];for i:=1 to a[0] doa[i]:=a[i]+b[i];for i:=1 to a[0] dobegintmp:=a[i] div mol; inc(a[i+1],tmp);a[i]:=a[i] mod mol;end;if a[a[0]+1]>0 then inc(a[0]);end;procedure cal;var now,last :boolean;change :boolean;max :longint;beginp:=k;now:=true; last:=false;fillchar(f,sizeof(f),0);for i:=0 to n dobeginf[now,i][0]:=1; f[now,i][1]:=1; end;dec(n);if w>k*n then w:=k*n;ans[0]:=1; ans[1]:=0;repeatnow:=not now; last:=not last; fillchar(f[now],sizeof(f[now]),0); change:=false;inc(p,k);if p>w thenbegindec(p,k); max:=w-p; p:=w;endelse max:=k;hiadd(f[now,n-1],f[last,n]);for i:=n-2 downto 0 dobeginf[now,i]:=f[now,i+1];hiadd(f[now,i],f[last,i+1]);end;if p>2*k then hiadd(ans,f[now,0]); until p=w;for i:=1 to pw[max]-1 dohiadd(ans,f[now,i]);assign(output,ouf);rewrite(output);n:=ans[0];write(ans[n]);for i:=n-1 downto 1 dobeginmax:=mol div 10;while max<>0 dobeginwrite(ans[i] div max mod 10);max:=max div 10;end;end;writeln;close(output);end;begininit; cal;end.。