Sereja

Codeforces 380C - Sereja and Brackets (线段树括号匹配)

C.SerejaandBracketstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahasabracketsequence s1, s2, ..., sn,or,inotherwords,astring s oflength n,consistingo
u011217342·2014-01-24 22:00

Sereja and Stairs（模拟 + STL）

Sereja and Stairs time limit per test 1 second memory limit per test 256 megabytes input
Simone_chou·2014-01-23 13:00

Sereja and Brackets

树状数组求区间内范围个数。。。。C.SerejaandBracketstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahasabracketsequence s1, s2, ..., sn,or,inotherwords,astring s ofleng
u012797220·2014-01-16 14:00

CF223B题Sereja and Stairs

B.SerejaandStairstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejalovesintegersequencesverymuch.Heespeciallylikesstairs.Sequence a1, a2, ..., a|a| (|a| 
u013013910·2014-01-14 14:00

CF223A题Sereja and Dima

这个题第一次理解错题意了。。A.SerejaandDimatimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejaandDimaplayagame.Therulesofthegameareverysimple.Theplayershave n cardsinar
u013013910·2014-01-14 14:00

Sereja and Prefixes

用longlong才能A。。。。。。害我TLE了半天。。。。用一个结构体记录，操作改变的区间范围 [c1 ,c2] , v ,youxiao 注意c1==c2时，并不一定表示一个有效的值所以需要一个标记。。。。当这个区间表示一个有效的值时，v表示有效值。。。。。否则v表示重复了多少次（用来递推）A.SerejaandPrefixestimelimitpertest1secondmemorylimi
u012797220·2014-01-13 17:00

Sereja and Stairs

B.SerejaandStairstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejalovesintegersequencesverymuch.Heespeciallylikesstairs.Sequencea1, a2, ..., a|a|(|a|ist
u013015642·2014-01-13 00:00

Sereja and Dima

A.SerejaandDimatimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejaandDimaplayagame.Therulesofthegameareverysimple.Theplayershavencardsinarow.Eachcardconta
u013015642·2014-01-13 00:00

Sereja ans Anagrams

B.SerejaansAnagramstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahastwosequences a and b andnumber p.Sequence a consistsof n integers a1, a2, ..., an
u011788531·2013-11-29 09:00

Sereja ans Anagrams

B.SerejaansAnagramstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahastwosequences a and b andnumber p.Sequence a consistsof n integers a1, a2, ..., an
u012797220·2013-11-29 00:00

Sereja and Suffixes

timelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahasanarray a,consistingof n integers a1, a2, ..., an.Theboycannotsitanddonothing,hedecidedtostudyanarra
jj12345jj198999·2013-11-28 16:00

Sereja and Coat Rack

timelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejaownsarestaurantfor n people.Therestauranthallhasacoatrackwith n hooks.Eachrestaurantvisitorcanuseahookt
jj12345jj198999·2013-11-27 14:00

cf-Round #215 (Div. 1) -B - Sereja ans Anagrams

昨晚上状态真的很不好，A题一个水题竟然把数组开错了。。。B题也是水题一个，开数组，遍历P。可以把数组a看成p个单链。第一个链：1,1+p,1+2p,......,1+(m-1)p第 i个链：i,i+p,i+2*p,i+3*p....i+(m-1)*p;这样每一个链从头往后扫，若扫到合适的情况，就记录下来。其中要把b数组离散，然后二分查找a数组中的元素在b中的位置。#include #include
rowanhaoa·2013-11-27 09:00

Sereja and Algorithm

Serejalovesallsortsofalgorithms.Hehasrecentlycomeupwithanewalgorithm,whichreceivesastringasaninput.Let'srepresenttheinputstringofthealgorithmasq = q1q2...qk.Thealgorithmconsistsoftwosteps:Findanyconti
libin56842·2013-11-27 01:00

Sereja and Suffixes

Serejahasanarraya,consistingofnintegersa1,a2,...,an.Theboycannotsitanddonothing,hedecidedtostudyanarray.Serejatookapieceofpaperandwroteoutmintegersl1, l2, ..., lm(1 ≤ li ≤ n).Foreachnumberlihewantstok
libin56842·2013-11-27 01:00

Sereja and Coat Rack

Serejaownsarestaurantfornpeople.Therestauranthallhasacoatrackwithnhooks.Eachrestaurantvisitorcanuseahooktohanghisclothesonit.Usingthei-thhookcostsairubles.Onlyonepersoncanhangclothesononehook.TonightS
libin56842·2013-11-27 01:00

Sereja and Ballons CC SEABAL

在爱神博客找到的题, 思路很巧妙,用链表把所有的盒子顺序连起来，然后在每次burst后维护维护链表如果盒子内的气球数不为0，则答案显然不会增加，直接输出上次答案，继续如果在burst后盒子i内的气球为0,则增加的答案数为左端点在(L[i],i],右端点在[i,R[i])的pair数目，然后删除这个节点(令L[R[i]]=L[i],R[L[i]]=L[i])，由于节点i至多被删除一次，所以每个pai
gyarenas·2013-10-05 17:00

Sereja and Bottles

timelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejaandhisfriendswenttoapicnic.Theguyshad n sodabottlesjustforit.Serejaforgotthebottleopenerasusual,sotheg
jj12345jj198999·2013-09-03 09:00

CC Sereja and Ballons (主席树)

转载请注明出处，谢谢http://blog.csdn.net/ACM_cxlove?viewmode=contents   by---cxlove题意：有n个盒子，每个盒子有若干个气球，每次操作可以拿走某个盒子的一个气球，然后给出一些区间，问每次操作后有多少个区间的盒子全为空。http://www.codechef.com/AUG13/problems/SEABAL做法：用链表维护一下当前位置前一
ACM_cxlove·2013-08-14 09:00

CodeForces 314B - Sereja and Periods 很有思维的DP

    题意:         对于一个字符串规定这样一种运算..字符串s与整数k..[s,k]=s+s+s+...k个s..如[abc,2]=abcabc...现在给出w=[a,b],q=[c,d]...问最大的p使得[q,p]为[a,b]的子串    题解:         练习赛的时候我是找循环节...思路是可行的..但就是搞不对...参考了大牛的代码...用dp来解决..思路是这样的:  
kk303·2013-08-08 14:00

codeforces 318 A.Even Odds B.Sereja and Array

A.EvenOdds 给你n和k，把从1到n先排奇数后排偶数排成一个新的序列，输出第k个位置的数。比如103 拍好后就是13579246810 第3个数是5。//cf318A //2013-06-18-20.30 #include usingnamespacestd; intmain() { __int64n,k; while(cin>>n>>k) { if(k #include #includ
xindoo·2013-06-18 21:00

codeforces 315 B.Sereja and Array

地址B.SerejaandArraytimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahasgotanarray,consistingof n integers, a1, a2, ..., an.Serejaisanactiveboy,soheisnowg
xindoo·2013-06-13 20:00

CF314-C Sereja and Subsequences

#include #include #include #include #include #include #include #include #include #include #include usingnamespacestd; #definelllonglong #defineN100500 #definemod1000000007 intn; lla[N];intidx[N]; lldp
Jackyguo1992·2013-06-09 21:00

CF 314B: Sereja and Periods

题目链接：http://codeforces.com/contest/314/problem/B题意：对于字符串s和正整数n，规定[s,n]=s+s+……+s;即  ["abc", 2] ="abcabc"现给出w = [a, b] , q = [c, d]求最大的p，使得 [q, p]是w的子序列如无合法p，则输出0由于CF可以看代码的缘故，一般不写CF题解。但是觉得这道题确实比较巧妙，于是记录
frog1902·2013-06-09 01:00

CF 315B - Sereja and Array（树状数组）

水题，树状数组就行了。。。注意三种操作。。。#include #include #include #defineFF(i,a,b)for(i=a;i=a;i--) #defineCLR(a,b)memset(a,b,sizeof(a)) #defineCPY(a,b)memcpy(a,b,sizeof(a)) #defineLL__int64 usingnamespacestd; constint
diary_yang·2013-06-08 20:00

CF 315A(Sereja and Bottles-开易拉罐)

A.SerejaandBottlestimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejaandhisfriendswenttoapicnic.Theguyshad n sodabottlesjustforit.Serejaforgotthebottleop
nike0good·2013-06-08 08:00

CF 315B(Sereja and Array-峰顶距离统计)

B.SerejaandArraytimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputSerejahasgotanarray,consistingof n integers, a1, a2, ..., an.Serejaisanactiveboy,soheisnowgoi
nike0good·2013-06-08 08:00
上一页 1 2 3 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他