{ ID:tsnoi201 PROG:fence8 LANG:PASCAL } program fence8; var i,j,m,n,ans:longint;      board,sb:array[0..51] of longint;      rail,sr:array[0..1024] of longint;      pd:boolean; procedure swap(var x,y:longint); var t:longint; begin      t:=x;x:=y;y:=t; end; procedure dfs(x,order:longint); var g:longint; begin      if x=1 then      begin          for g:=1 to m do if board[g]>=rail[x] then        &nbsp

经过一个下午的努力，我终于将我学习OI三年的一个夙愿完成了。那就是成功AC了一道题：超长字符串 type ar=array[0..1001] of longint; var i,j,k,n,t:longint;      a,mid,num,ans:ar;      start:ar;startpos:longint;            //起始数字及头部在起始数字的位置      pd,done,wangzilong:boolean;      c:char; procedure minus(var mid:ar);              //将

var i,j,l,m,n,p,q,t,pre,now,head,tail:longint;      trie:array[0..200000,'A'..'Z'] of longint;      father,next,num,queue:array[0..200000] of longint;      c:array[0..200000] of char;      dg:array[0..200000] of boolean;      dp:array[0..2,0..100000] of double;      win:array[0..100000] of double;      pb:array['A'..'Z',1..2] of double;      s:string;      ch,en,mmm:char;   &

试题名称 fall song heightround color 输入文件名 fall.in song.in heightround.in color.in 输出文件名 fall.out song.out heightround.out color.out 试题类型 非交互式程序题 非交互式程序题 非交互式程序题 非交互式程序题 时限 1秒 1秒 1秒 1秒 下落(fall) 〔问题描述〕 在直角坐标系上，有一个小球开始从坐标(x,y) x>0,y>0 处直线下落，每一秒钟一个单位距离，一直到X轴为止。然而，它可能在下落过程中碰到一些障碍物。障碍物可以看成是一些平行于X轴的水平线段，如果

var i,j,k,l,m,n,sum,many,winlose,tie,oup:longint;      score:array[1..8] of longint;      can,tt:lon

var i,j,k,l,m,n,p,q,r,s,t,d:longint; father,left,right,data,delta,mid:array[0..300000] of longint; xd:array[0..300000,1..2] of longint; hx:array[0..100000] of longint; function max(x,y:longint):longint; begin if x>y then exit(x) else exit(y); end; function ask_max(l,r,num:longint):longint; begin if (l=xd[num,1])and(r=xd[num,2]) then exit(data[num]); if r<=mid[num] then ask_max:=ask_max(l,r,left[num]) else if l>mid[num] then ask_max:=ask_max(l,r,right[num]) else ask_max:=max(ask_max(l,mid[num],left[num]),ask_max(mid[num]+1,r,right[num])); inc(ask_max,delta[

直接发了。。 program p1665; type      sbtnode=record          lsb,rsb,key,s:longint;          end;      intervaltree=record          tot,root,lc,rc:longint;          l,r,m,d:longint;          end; var      ctree:array[0..150003]of intervaltree;      sbt:array[1..18,0..100002]of sbtnode;  &nb

//SRC be locked var i,j,k,l,m,n,p,q,r,s,t:longint;      root,len:array[1..500] of longint; //SRC be locked function f(x:longint):longint; var s:longint; begin      if root[x]=x then exit(x);      s:=root[x];      root[x]:=f(root[x]);      len[x]:=len[x]+len[s];      exit(root[x]); end; //SRC be locked begin      read(n,p);      for i:=1 to n do root[i]:=i;      for i:=1 to p do      begin  &n

//SRC is locked var i,l,r,t,cccum:longint;    ltk,w,size:array[1..30000] of longint;    c:char; //SRC is locked function

program gaosi; const maxn=300; var i,j,k,l,m,n:longint; a:array[1..maxn,1..maxn] of double; ur,uc:array[1..maxn] of boolean; row,col:array[1..maxn] of longint; x:array[1..maxn] of double; procedure enter; begin read(n); for i:=1 to n do for j:=1 to n+1 do read(a[i,j]); end; procedure main; var i,j,k:longint; pivot,tmp:double; begin for k:=1 to n do begin pivot:=0; for i:=1 to n do for j:=1 to n do if not ur[i] then if not uc[j] then if a[i,j]>pivot then begin pivot:=a[i,j]; row[k]:=i; col[k]:=j;

program war; var i,j,k,l,m,n,p,q,r,t,tt,root,d,x:longint; left,right,father,sontree:array[0..30000] of longint; hp:array[0..30000] of long

var i,j,k,l,m,n,p,q,r,s,t,x1,x2,y1,y2:longint; can,sel,v:array[0..8,0..8] of boolean; short,len:array[1..7,1..7] of longint; quene:array[1..100,1..2] of longint; c:char; pd:boolean; procedure dfs(x,y,deep:longint); var g:longint; begin if (x=x2)and(y=y2) then begin if deep=t then pd:=true; exit; end; can[x,y]:=false; if can[x-1,y] then dfs(x-1,y,deep+1); if pd then begin can[x,y]:=true;exit; end; if can[x+1,y] then dfs(x+1,y,deep+1); if pd then begin can[x,y]:=true;exit; end; if can[x,y-1] then dfs(x,y-1,deep+1); if pd then begin can[x,y]:=true;exit; end;

var i,j,k,l,n,b:longint； m,c,a:longint;      r:double;      ans:array[1..1000,1..2] of longint; beg

http://club.chinaren.com/150705253.html

var i,j,k,l,m,n,x,y,many,x1,x2,y1,y2:longint; s:array[0..1024,0..1024] of int64; function sum(x,y:longint):int64; var g:longint; begin

一楼百度

#include <cstdio> #include <memory.h> #include <algorithm>     // 使用其中的 min 函数 using namespace

Test 1: TEST OK [0.000 secs, 216 KB]     Test 2: TEST OK [0.238 secs, 212 KB]     Test 3: TEST OK [0.205 secs,

Compiling... Compile: OK Executing...     Test 1: TEST OK [0.000 secs, 384 KB]     Test 2: TEST OK [0.000 secs

USER: Renchu Song [songren1] TASK: picture LANG: PASCAL Compiling... Compile: OK Executing...     Test 1: TEST OK [0.000 secs

啊

左一是宋壬初

‘生化微机组合’是TSYZ的GYES班的铁打品牌，由WZL,LWY，SRC三位竞赛大牛组成。因分属生物、化学、计算机信息学而得名。

宋壬初，男，1992年生人，现就读于唐山市第一中学。信息技术爱好者，共青团员，爱国青年。      人生终极理想，为黄土高原生态恢复作贡献。短期目标，考上好大学，自主创业，筹措资金，为终极理想的实现不懈奋斗。      希望广大志同道合的人士与之一同努力，为开拓祖国的美好明天挥洒汗水！