- 博客(9)
- 收藏
- 关注
RSS订阅转载 noi4_6_1799[最短前缀]
字典树。数据不大，代码不短……type knot=record sum:longint; son:array[0..30] of longint; ch:char; end;var tree:array[1..30000] of knot; st:array[1..1000...
2016-10-08 23:46:00
192
转载 noi4_7_8468[单词序列]
爆搜都能过……我佩服它的数据规模uses math;var f:array[1..10000] of boolean; a:array[1..100] of string[6]; n:longint; start,final:string[6]; ans:longint;function cj(a,b:string):boolean...
2016-10-05 22:04:00
132
转载 noi4_1_1754[字符串数组排序问题]
没忽略空格竟ACvar way:string; a,b:array[1..100000] of string; n:longint;function cl(a,b:string):boolean;begin if (way='inc')or(way='dec') then exit(a>b); exit(lowercase(a)>lowercase(b))...
2016-10-05 21:13:00
151
转载 noi4_1_1999[日志排序]
复杂的判断&多余的空格=n个wrong answertype event=record st:string[100]; year,mon,day,hour,min,sec,lse:integer; t:longint; end;var a:array[1..10000] ...
2016-10-05 20:50:00
129
转载 noi1_13_41[判断元素是否存在]
简单的dfs。不必考虑时间。瞬秒。var s,s1,s2:string; k,n,m:longint;procedure go(k:longint);begin if k=m then begin write('YES'); halt; end; if k>m th...
2016-10-05 00:17:00
160
转载 【2011noip提高】选择客栈
不会O（n）……只好用线段树O（nlogn）uses math;var n,k,p,i,j,c,ans,minp,tot:longint; co:array[0..50,0..50000] of longint; f:array[0..600000] of longint; a:array[0..200000] of longint;procedure buildt...
2016-10-05 00:03:00
68
转载 noi4_6_3528[最小新整数]
经典的贪心，每次去掉第一个递增序列最后一个数字，（少了一个等号查了20min错TAT）var s:ansistring; i,j,k,n,m,hh:longint;begin readln(n); for j:=1 to n do begin readln(s); hh:=pos(' ',s); val(copy(s,hh+1,length(s)-hh)...
2016-10-04 22:01:00
116
转载 noi1_13_48[实数加法]
高精度小数加法……一开始对齐弄了半天，teacher却告诉我可以固定小数点在数组的100号……uses math;type arr=array[-1..200] of longint;var a,b,c:arr;procedure putin(var a:arr);var k,i:longint; s:string;begin fillchar(a,sizeof(a),0); rea...
2016-10-04 19:14:00
405
转载 math与cena之争
今天用cena测金陵中学一次竞赛（圣诞赛）……被cena狠狠坑了……源码：uses math;var a:array[1..200] of longint; f:array[1..200,1..200] of boolean; n,i,big,j,x:longint;begin assign(input,'tree.in'); reset(input); ...
2016-09-25 22:24:00
187
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人