摘要:
爆搜都能过……我佩服它的数据规模 阅读全文
posted @ 2016-10-05 22:04
love_saber
阅读(289)
评论(1)
推荐(0)
摘要:
没忽略空格竟AC var 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); 阅读全文
posted @ 2016-10-05 21:13
love_saber
阅读(362)
评论(0)
推荐(0)
摘要:
复杂的判断&多余的空格=n个wrong answer 阅读全文
posted @ 2016-10-05 20:50
love_saber
阅读(255)
评论(0)
推荐(0)
摘要:
简单的dfs。不必考虑时间。瞬秒。 阅读全文
posted @ 2016-10-05 00:17
love_saber
阅读(323)
评论(0)
推荐(0)
摘要:
不会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.. 阅读全文
posted @ 2016-10-05 00:03
love_saber
阅读(327)
评论(0)
推荐(0)