码迷,mamicode.com
首页 > 其他好文 > 详细

lalla

时间:2015-01-05 21:54:32      阅读:258      评论:0      收藏:0      [点我收藏+]

标签:

asdjflkajdf adlkgjlkdjflkjldkf Heading - enter code here enter code here #include # Blockquote include include include include define MAXN 1000005 using namespace std; int n, p[MAXN], la[MAXN], ans; char s[MAXN]; bool pd(int w, int x){if(p[w - 2 * x] < x || p[w + 2 * x] < x)return 0; return 1;} int main() { scanf(鈥?%d鈥?, &n); scanf(鈥?%s鈥?, s + 1); for(int i = n; i; i 鈥?)s[i * 2] = s[i], s[i * 2 - 1] = 鈥?*鈥?; s[0] = 鈥?#鈥?; #include #incldue using namespace std; int main(){ for(int i = 1; i <= n; i ++) } Written with StackEdit.

lalla

标签:

原文地址:http://www.cnblogs.com/lixintong911/p/4204597.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!