摘要：模拟题目，先把P转换成 字符串 ，然后在求 Wq By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right parenthesis in S (P-sequence).q By an integer sequence W = w1 w2...wn where for each right parenthesis, say a in S, we associate an integer which is the number of right pare 阅读全文

摘要：/*8768930 MDK 2503 Accepted 16076K 2282MS G++ 1608B 2011-06-18 09:36:54 *///POJA一题真不容易//MAP水过int main(){ //freopen("d:\\2.txt","r",stdin); char buff[30]; map<string,string> mss;mss.clear(); while(1) { char tmp=getchar(); if(tmp=='\n') break; char s1[11],s2[11]; s1[0 阅读全文

摘要：标准一字符串处理的题，看到题马上想到的是map<string,int>，然后果断超时，而后改成的map<int,int>，WA了，查查结题报告，发现输出要控制宽度，不懂！望大家给解释，时间是960MS/*8701557MDK1002Accepted3992K954MSG++1605B2011-05-29 08:46:42*/#include<stdio.h>#include<iostream>#include<limits.h>#include<string.h>#include<math.h>#include 阅读全文