csu 1008 Horcrux
摘要:
换成栈就解决了超时,时间上还可以优化。 1 # include <stdio.h> 2 # include <memory.h> 3 4 # define MAXN 100005 5 6 unsigned short s[MAXN]; 7 int top; 8 9 int main()10 {11 int n, x, i, f, t, tot, top;12 13 while (~scanf("%d", &n))14 {15 f = top = tot = 0;16 memset(s, 0, sizeof(... 阅读全文
posted @ 2012-03-18 23:39 getgoing 阅读(483) 评论(0) 推荐(0) 编辑