锘??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>
8
using namespace std;
9
10
const int maxn = 1000000 + 10;
11
int Q[maxn<<1], sum[maxn<<1];
12
char neck[maxn<<1];
13
int vis[2][maxn];
14
15
void 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
33
int 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

]]>
青青热久久国产久精品|
A狠狠久久蜜臀婷色中文网|
9999国产精品欧美久久久久久|
久久精品国产半推半就|
久久久久久久综合综合狠狠|
国产成人精品久久|
久久99国产精品99久久|
久久久久人妻精品一区三寸蜜桃
|
欧美精品一区二区久久|
四虎久久影院|
色综合久久中文综合网|
97精品依人久久久大香线蕉97|
国产成人久久精品一区二区三区|
久久久久黑人强伦姧人妻|
新狼窝色AV性久久久久久|
久久久久亚洲AV综合波多野结衣|
久久99国产综合精品女同|
亚洲精品无码久久不卡|
99久久国产综合精品网成人影院
|
精品久久久久久中文字幕人妻最新|
91久久福利国产成人精品|
精品久久久久久亚洲精品|
久久精品免费一区二区|
伊人色综合久久天天网|
狠狠人妻久久久久久综合|
99久久免费国产精精品|
久久久亚洲欧洲日产国码二区|
亚洲精品NV久久久久久久久久|
精品无码久久久久久久动漫|
久久香蕉国产线看观看99|
99久久成人国产精品免费|
精品国产一区二区三区久久久狼|
伊人久久综合无码成人网|
久久这里有精品视频|
亚洲精品视频久久久|
久久久久国色AV免费观看|
热久久国产欧美一区二区精品|
久久久久亚洲爆乳少妇无|
久久综合偷偷噜噜噜色|
久久妇女高潮几次MBA|
99蜜桃臀久久久欧美精品网站|