锘??xml version="1.0" encoding="utf-8" standalone="yes"?>欧美电影在线,久久精品日韩,欧美精品九九http://www.shnenglu.com/AmazingCaddy/category/14302.htmlzh-cnFri, 08 Oct 2010 07:31:32 GMTFri, 08 Oct 2010 07:31:32 GMT60- sgu 433 Japhshan and Ramshuthttp://www.shnenglu.com/AmazingCaddy/archive/2010/10/06/128823.htmlAmazingCaddyAmazingCaddyWed, 06 Oct 2010 14:08:00 GMThttp://www.shnenglu.com/AmazingCaddy/archive/2010/10/06/128823.htmlhttp://www.shnenglu.com/AmazingCaddy/comments/128823.htmlhttp://www.shnenglu.com/AmazingCaddy/archive/2010/10/06/128823.html#Feedback0http://www.shnenglu.com/AmazingCaddy/comments/commentRss/128823.htmlhttp://www.shnenglu.com/AmazingCaddy/services/trackbacks/128823.html闃呰鍏ㄦ枃
]]> - hdu 2665 Kth Numberhttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/26/121302.htmlAmazingCaddyAmazingCaddyMon, 26 Jul 2010 06:06:00 GMThttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/26/121302.htmlhttp://www.shnenglu.com/AmazingCaddy/comments/121302.htmlhttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/26/121302.html#Feedback0http://www.shnenglu.com/AmazingCaddy/comments/commentRss/121302.htmlhttp://www.shnenglu.com/AmazingCaddy/services/trackbacks/121302.html闃呰鍏ㄦ枃
]]> - hdu 3474 Necklacehttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/25/121235.htmlAmazingCaddyAmazingCaddySun, 25 Jul 2010 04:23:00 GMThttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/25/121235.htmlhttp://www.shnenglu.com/AmazingCaddy/comments/121235.htmlhttp://www.shnenglu.com/AmazingCaddy/archive/2010/07/25/121235.html#Feedback0http://www.shnenglu.com/AmazingCaddy/comments/commentRss/121235.htmlhttp://www.shnenglu.com/AmazingCaddy/services/trackbacks/121235.htmlhttp://acm.hdu.edu.cn/showproblem.php?pid=3474
鍗曡皟闃熷垪錛屽張鏄涓嬈′嬌鐢紝鏈漢钂熻捇鏃犳瘮鍟娿傘傘?br>
hdu 3474
1
#include <cstdio>
2#include <iostream>
3#include <cmath>
4#include <complex>
5#include <algorithm>
6#include <cstring>
7#include <queue>
8using namespace std;
9
10const int maxn = 1000000 + 10;
11int Q[maxn<<1], sum[maxn<<1];
12char neck[maxn<<1];
13int vis[2][maxn];
14
15void solve( int n, int m, int v )
16
{
17
sum[0] = 0;
18 for( int i = 1; i < m; i++ )
19 sum[i] = sum[i-1] + ( neck[i] == 'C' ? 1 : -1 );
20 int head = 0, tail = 0;
21 for( int i = 0; i < m; i++ )
22
{
23 while( head < tail && sum[Q[tail-1]] >= sum[i] ) tail--;
24 Q[tail++] = i;
25 if( i >= n )
26 {
27 while( i - Q[head] >= n ) head++;
28 vis[v][i-n] = ( sum[i-n] <= sum[Q[head]] );
29
}
30 }
31
}
32
33int main(int argc, char *argv[])
34{
35 int t;
36 scanf("%d",&t);
37 for( int p = 1; p <= t; p++ )
38 {
39 scanf("%s",neck+1);
40 int n = strlen( neck + 1 );
41 int m = n * 2 + 1;
42 for( int i = 1; i <= n; i++ )
43 neck[i+n] = neck[i];
44 neck[m] = 0;
45 memset( vis, 0, sizeof( vis ) );
46 solve( n, m, 0 );
47 reverse( neck + 1, neck + m );
48 solve( n, m, 1 );
49 int ans = 0;
50 for( int i = 1; i <= n; i++ )
51 if( vis[0][i] || vis[1][n-i] ) ans ++;
52 printf("Case %d: %d\n",p,ans);
53 }
54 return 0;
55}
56
]]>
国产精品99久久不卡|
久久无码中文字幕东京热|
久久亚洲日韩精品一区二区三区|
久久国产色av免费看|
久久99精品久久久久子伦|
99久久国产热无码精品免费久久久久|
国内精品久久久久久麻豆|
麻豆国内精品久久久久久|
久久亚洲AV无码精品色午夜|
精品永久久福利一区二区|
国产精品青草久久久久福利99|
久久综合五月丁香久久激情|
久久夜色精品国产噜噜亚洲AV|
久久国产精品99久久久久久老狼|
国内精品伊人久久久久网站|
国产成人精品综合久久久|
亚洲一区中文字幕久久|
国产精品久久久久久久久久影院|
国产三级久久久精品麻豆三级|
久久嫩草影院免费看夜色|
久久精品无码一区二区无码|
日本久久久久久久久久|
国产欧美久久一区二区|
色妞色综合久久夜夜|
国产国产成人久久精品|
久久精品亚洲中文字幕无码麻豆|
久久精品成人一区二区三区|
国产麻豆精品久久一二三|
久久久这里只有精品加勒比|
大美女久久久久久j久久|
亚洲日韩中文无码久久|
日韩欧美亚洲综合久久影院d3|
超级97碰碰碰碰久久久久最新|
国产精品久久久久aaaa|
久久综合国产乱子伦精品免费|
欧美激情精品久久久久久|
蜜桃麻豆www久久|
欧美激情精品久久久久|
色综合久久久久|
国产成人综合久久久久久|
99国产欧美久久久精品蜜芽|