1507: [NOI2003]Editor<\/h2>\n
Time Limit: <\/span>5 Sec Memory Limit: <\/span>162 MB \u8fd9\u9898\u6211\u662f\u7528\u5757\u72b6\u94fe\u8868\u505a\u7684<\/span><\/p>\n \u5757\u72b6\u94fe\u8868\u7684\u590d\u6742\u5ea6\u5927\u7ea6\u662fO\uff08\u221an\uff09<\/span><\/p>\n \u4e00\u5b9a\u8981\u5c3d\u53ef\u80fd\u5c06\u5757\u5206\u6210\u957f\u5ea6\u4e3a\u221atot\u7684\uff0cbalance()\u65f6\u8981\u628a\u6240\u6709\u7684\u957f\u5ea6\u5206\u4e3a\u4ecb\u4e8e1\/2\u221atot-2\u221atot\u4e4b\u95f4<\/span><\/span><\/span><\/p>\n \u53e6\u5916merge\u65f6\u8981\u6ce8\u610f\u5148\u628acur\u79fb\u52a8\u518d\u91cd\u8f7d\u5408\u5e76格\u7684\u957f\u5ea6\uff08\u4e0d\u5bb9\u6613\u67e5\u51fa\u9519,\u4e0d\u77e5\u4e3a\u4f55,\u52a0\u9519\u4e5f\u80fd\u8fc78\u4e2a\u70b9\uff09<\/span><\/span><\/span><\/p>\n \u8981\u53c2\u8003\u8001\u8463\u7684\u8bb2\u89e3<\/a>\u4e0enocow\u7684\u6a21\u677f<\/a><\/span><\/span><\/span><\/p>\n <\/span><\/span><\/p>\n 1507: [NOI2003]Editor Time Limit: 5 Sec   […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_coblocks_attr":"","_coblocks_dimensions":"","_coblocks_responsive_height":"","_coblocks_accordion_ie_support":"","footnotes":""},"categories":[3],"tags":[68],"class_list":["post-336","post","type-post","status-publish","format-standard","hentry","category-defaultcategory","tag-block_chain"],"yoast_head":"\n
\nSubmit: <\/span>922 Solved: <\/span>323
\n[Submit<\/a>][Status<\/a>][Discuss<\/a>]<\/center><\/p>\nDescription<\/h2>\n
\n\u591a\u5e74\u4e4b\u540e\uff0c\u51fa\u4e8e\u5076\u7136\u7684\u673a\u4f1a\uff0c\u5c0f\u660e\u627e\u5230\u4e86\u5f53\u65f6\u7684\u4e00\u4e2a\u7f16\u8f91\u8f6f\u4ef6\u3002\u8fdb\u884c\u4e86\u4e00\u4e9b\u7b80\u5355\u7684\u6d4b\u8bd5\u540e\uff0c\u5c0f\u660e\u60ca\u5947\u5730\u53d1\u73b0\uff1a\u90a3\u4e2a\u8f6f\u4ef6\u6bcf\u79d2\u80fd\u591f\u8fdb\u884c\u4e0a\u4e07\u6b21\u7f16\u8f91\u64cd\u4f5c\uff08\u5f53\u7136\uff0c\u4f60\u4e0d\u80fd\u624b\u5de5\u8fdb\u884c\u8fd9\u6837\u7684\u6d4b\u8bd5\uff09\uff01\u4e8e\u662f\uff0c\u5c0f\u660e\u5e9f\u5bdd\u5fd8\u98df\u5730\u60f3\u505a\u4e00\u4e2a\u540c\u6837\u7684\u4e1c\u897f\u51fa\u6765\u3002\u4f60\u80fd\u5e2e\u52a9\u4ed6\u5417\uff1f
\n\u4e3a\u4e86\u660e\u786e\u4efb\u52a1\u76ee\u6807\uff0c\u5c0f\u660e\u5bf9\u201c\u6587\u672c\u7f16\u8f91\u5668\u201d\u505a\u4e86\u4e00\u4e2a\u62bd\u8c61\u7684\u5b9a\u4e49\uff1a
\n\u6587\u672c\uff1a\u7531 0 \u4e2a\u6216\u591a\u4e2a\u5b57\u7b26\u6784\u6210\u7684\u5e8f\u5217\u3002\u8fd9\u4e9b\u5b57\u7b26\u7684 ASCII \u7801\u5728\u95ed\u533a\u95f4[32, 126]\u5185\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u8fd9\u4e9b\u5b57\u7b26\u5747\u4e3a\u53ef\u89c1\u5b57\u7b26\u6216\u7a7a格\u3002
\n\u5149\u6807\uff1a\u5728\u4e00\u6bb5\u6587\u672c\u4e2d\u7528\u4e8e\u6307\u793a\u4f4d\u7f6e\u7684\u6807\u8bb0\uff0c\u53ef\u4ee5\u4f4d\u4e8e\u6587\u672c\u7684\u7b2c\u4e00\u4e2a\u5b57\u7b26\u4e4b\u524d\uff0c\u6587\u672c\u7684\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\u4e4b\u540e\u6216\u6587\u672c\u7684\u67d0\u4e24\u4e2a\u76f8\u90bb\u5b57\u7b26\u4e4b\u95f4\u3002
\n\u6587\u672c\u7f16\u8f91\u5668\uff1a\u4e3a\u4e00\u4e2a\u53ef\u4ee5\u5bf9\u4e00\u6bb5\u6587\u672c\u548c\u8be5\u6587\u672c\u4e2d\u7684\u4e00\u4e2a\u5149\u6807\u8fdb\u884c\u5982\u4e0b\u516d\u6761\u64cd\u4f5c\u7684\u7a0b\u5e8f\u3002
\n\u5982\u679c\u8fd9\u6bb5\u6587\u672c\u4e3a\u7a7a\uff0c\u6211\u4eec\u5c31\u8bf4\u8fd9\u4e2a\u6587\u672c\u7f16\u8f91\u5668\u662f\u7a7a\u7684\u3002
\n![\"\"](\"http:\/\/nike0good.jp1.rpvhost.net\/wp-content\/uploads\/csdn\/other_site\/img_my_1361541906_7559.png\")
\n\u4f60\u7684\u4efb\u52a1\u662f\uff1a
\n \u5efa\u7acb\u4e00\u4e2a\u7a7a\u7684\u6587\u672c\u7f16\u8f91\u5668\u3002
\n \u4ece\u8f93\u5165\u6587\u4ef6\u4e2d\u8bfb\u5165\u4e00\u4e9b\u64cd\u4f5c\u6307\u4ee4\u5e76\u6267\u884c\u3002
\n \u5bf9\u6240\u6709\u6267\u884c\u8fc7\u7684 GET \u64cd\u4f5c\uff0c\u5c06\u6307\u5b9a\u7684\u5185\u5bb9\u5199\u5165\u8f93\u51fa\u6587\u4ef6\u3002<\/div>\nInput<\/h2>\n
\n\u4e3a\u4e86\u4f7f\u8f93\u5165\u6587\u4ef6\u4fbf\u4e8e\u9605\u8bfb\uff0cInsert \u64cd\u4f5c\u7684\u5b57\u7b26\u4e32\u4e2d\u53ef\u80fd\u4f1a\u63d2\u5165\u4e00\u4e9b\u56de\u8f66\u7b26\uff0c\u8bf7\u5ffd\u7565\u6389\u5b83\u4eec\uff08\u5982\u679c\u96be\u4ee5\u7406\u89e3\u8fd9\u53e5\u8bdd\uff0c\u53ef\u4ee5\u53c2\u8003\u6837\u4f8b\uff09\u3002
\n\u9664\u4e86\u56de\u8f66\u7b26\u4e4b\u5916\uff0c\u8f93\u5165\u6587\u4ef6\u7684\u6240\u6709\u5b57\u7b26\u7684 ASCII \u7801\u90fd\u5728\u95ed\u533a\u95f4[32, 126]\u5185\u3002\u4e14\u884c\u5c3e\u6ca1
\n\u6709\u7a7a格\u3002
\n\u8fd9\u91cc\u6211\u4eec\u6709\u5982\u4e0b\u5047\u5b9a\uff1a
\n1. MOVE \u64cd\u4f5c\u4e0d\u8d85\u8fc7 50000 \u4e2a\uff0cINSERT \u548c DELETE \u64cd\u4f5c\u7684\u603b\u4e2a\u6570\u4e0d\u8d85\u8fc7 4000\uff0cPREV \u548c NEXT \u64cd\u4f5c\u7684\u603b\u4e2a\u6570\u4e0d\u8d85\u8fc7 200000\u3002
\n2. \u6240\u6709 INSERT \u63d2\u5165\u7684\u5b57\u7b26\u6570\u4e4b\u548c\u4e0d\u8d85\u8fc7 2M\uff081M=1024*1024\uff09\uff0c\u6b63\u786e\u7684\u8f93\u51fa\u6587\u4ef6\u957f\u5ea6\u4e0d\u8d85\u8fc7 3M \u5b57\u8282\u3002
\n3. DELETE \u64cd\u4f5c\u548c GET \u64cd\u4f5c\u6267\u884c\u65f6\u5149\u6807\u540e\u5fc5\u7136\u6709\u8db3\u591f\u7684\u5b57\u7b26\u3002MOVE\u3001PREV\u3001NEXT\u64cd\u4f5c\u4e0d\u4f1a\u628a\u5149\u6807\u79fb\u52a8\u5230\u975e\u6cd5\u4f4d\u7f6e\u3002
\n4. \u8f93\u5165\u6587\u4ef6\u6ca1\u6709\u9519\u8bef\u3002
\n\u5bf9 C++\u9009\u624b\u7684\u63d0\u793a\uff1a\u7ecf\u6d4b\u8bd5\uff0c\u5bf9\u6700\u5927\u7684\u6d4b\u8bd5\u6570\u636e\u4f7f\u7528 fstream \u8fdb\u884c\u8f93\u5165\u6709\u53ef\u80fd\u4f1a\u6bd4\u4f7f\u7528 stdio \u6162\u7ea6 1 \u79d2\uff0c\u56e0\u6b64\u5efa\u8bae\u5728\u53ef\u4ee5\u7684\u60c5\u51b5\u4e0b\u4f7f\u7528\u540e\u8005\u3002<\/div>\nOutput<\/h2>\n
Sample Input<\/h2>\n
\nInsert 26
\nabcdefghijklmnop
\nqrstuv wxy
\nMove 16
\nDelete 11
\nMove 5
\nInsert 1
\n^
\nNext
\nInsert 1
\n_
\nNext
\nNext
\nInsert 4
\n.\/.
\nGet 4
\nPrev
\nInsert 1
\n^
\nMove 0
\nGet 22
\n<\/span><\/div>\nSample Output<\/h2>\n
\nabcde^_^f.\/.ghijklmno
\n<\/span><\/div>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<functional>\n#include<iostream>\n#include<cmath>\n#include<cstdlib>\n#include<cmath>\nusing namespace std;\n#define MAXP (1024*1024)\n#define MAXN (2900)\nstruct block\n{\n int n;\n char a[MAXN];\n block *next,*pre;\n block():n(0){next=pre=NULL;}\n}*first;\nblock* q[MAXN];\nint size=0,tot=0;\nvoid del(block *x)\n{\n q[++size]=x;\n if (x->pre) x->pre->next=x->next;\n if (x->next) x->next->pre=x->pre;\n if (x==first) first=x->next;\n}\nblock *newblock()\n{\n if (size) return q[size--];\n block *x=new block();\n return x;\n}\nvoid link(block *a,block *b)\n{\n if (a) a->next=b;\n if (b) b->pre=a;\n}\nvoid spilt(block *x,int nowsize)\n{\n if (!nowsize||nowsize==x->n) return;\n block *tmp=x->next;\n x->next=newblock();\n block *x2=x->next;\n x2->n=x->n-nowsize;\n for (int i=1;i<=x2->n;i++) x2->a[i]=x->a[nowsize+i];\n x->n=nowsize;\n link(x2,tmp);\n link(x,x2);\n}\nstruct cursor\n{\n int n;\n block *ll;\n cursor():n(0){ll=first; }\n void pre()\n {\n n--;\n if (n<0)\n {\n ll=ll->pre;\n n=ll->n-1;\n }\n }\n void next()\n {\n n++;\n if (n>ll->n)\n {\n ll=ll->next;\n n=1;\n }\n }\n void move(int k)\n {\n n=k,ll=first;\n while (n>ll->n)\n {\n n-=ll->n;\n ll=ll->next;\n }\n }\n}cur;\nvoid get(cursor cur,int k)\n{\n int p=cur.ll->n-cur.n;\n if (p>=k)\n {\n for (int i=cur.n+1;i<=cur.n+k;i++)\n printf("%c",cur.ll->a[i]);\n }\n else\n {\n for (int i=cur.n+1;i<=cur.ll->n;i++) printf("%c",cur.ll->a[i]);\n cur.ll=cur.ll->next;cur.n=0;\n get(cur,k-p);\n }\n}\nvoid merge(block *x)\n{\n if (!x->next) return;\n for (int i=1;i<=x->next->n;i++) x->a[x->n+i]=x->next->a[i];\n if (cur.ll==x->next)\n {\n cur.ll=x;\n cur.n+=x->n;\n }\n x->n+=x->next->n;\n del(x->next);\n}\nvoid balance()\n{\n int maxsize=min(MAXN,(int)sqrt(tot)*2);\n int minsize=(int)sqrt(tot)\/2;\n block *x=first;\n while (x)\n {\n while (x->n<minsize||x->n>maxsize)\n {\n if (x->n<minsize)\n {\n merge(x);\n if (!x->next) break;\n \/\/ get(cur,1);\n }\n else\n {\n spilt(x,(x->n)>>1);\n if (cur.ll==x&&cur.n>cur.ll->n)\n {\n cur.n-=cur.ll->n;\n cur.ll=cur.ll->next;\n }\n \/\/ get(cur,1);\n }\n }\n x=x->next;\n }\n}\nvoid delet(int k)\n{\n if (!k) return;\n if (cur.n)\n {\n spilt(cur.ll,cur.n);\n cur.ll=cur.ll->next; cur.n=0;\n }\n while (k>cur.ll->n)\n {\n del(cur.ll);\n k-=cur.ll->n;\n cur.ll=cur.ll->next;\n \/\/ cur.n=0;\n }\n if (k==cur.ll->n)\n {\n cur.ll->n=0;\n }\n else\n {\n spilt (cur.ll,k);\n delet(k);\n }\n balance();\n}\nvoid insert(int k)\n{\n block *l=newblock();*l=block();\n block *r=l;\n int maxsize=min(MAXN,(int)sqrt(tot));\n for (int i=1;i<=k;i++)\n {\n char c;\n for (scanf("%c",&c);(c<32)||(c>126)||(c=='n');scanf("%c",&c));\n if (r->n>maxsize)\n {\n block *tmp=r;\n r=newblock();*r=block();link(tmp,r);\n }\n r->a[++r->n]=c;\n }\n if (cur.n)\n {\n spilt(cur.ll,cur.n);\n block *tmp=cur.ll->next;\n link(cur.ll,l),link(r,tmp);\n }\n else\n {\n link(cur.ll->pre,l),link(r,cur.ll),cur.ll=l;\n if (first->pre) first=l;\n }\n balance();\n}\nint main()\n{\n first=newblock();cur.ll=first;\n int t;scanf("%d",&t);\n while (t--)\n {\n char s[10];\n scanf("%s",s);\n int k;\n switch(s[0])\n {\n case'M':scanf("%d",&k);cur.move(k);break;\n case'I':scanf("%d",&k);tot+=k;insert(k);break;\n case'D':scanf("%d",&k);tot-=k;delet(k);break;\n case'G':scanf("%d",&k);get(cur,k);printf("n");break;\n case'P':cur.pre();break;\n case'N':cur.next();break;\n }\n\/\/ get(cursor(),tot);cout<<endl;\n }\n return 0;\n}<\/pre>\n\n<\/h2>\n","protected":false},"excerpt":{"rendered":"