摘要：map内部是用红黑树维持的有序结构。定义：mapmapStudent;查找的时间复杂度为对数级别.1.构造方法学习两种：第一种：用insert函数插入pair数据，mapStudent.insert(pair(0,"jiangjing"));第二种：用数组方式插入数据mapStudent[1] = ... 阅读全文

摘要：#include#include#include#include#includeusing namespace std;struct node{ int t1; int t2;};vectorQ[100005];__int64 sum[100005],s;int cmp(node a,node b){ if(a.t1max) max=cao; } for(i=1;i=i) s+=Q[j][i-1].t2; sum[i]=sum[i-1]+s; } w... 阅读全文

摘要：[A] A Breaking Computer时间限制: 1000 ms　内存限制: 65535 K问题描述Oh my god.My computer is break.When I writing something,the home and the end always is working.But I also write too quakily,even I don't see the screen.OK,when I finish a work ,can you tell me the work become in end?We modified the sample out 阅读全文