https://blog.youkuaiyun.com/pcccccccccczh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/pcccccccccc/article/details/78429550https://blog.youkuaiyun.com/pcccccccccc/article/details/78429550pccccccccccThu, 02 Nov 2017 21:23:18 +0800 #include #include//！！！头文件 using namespace std; vector a[100]; int main() { for(int i=1;i<=2]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/78327549https://blog.youkuaiyun.com/pcccccccccc/article/details/78327549pccccccccccTue, 24 Oct 2017 11:16:51 +0800 #include #include using namespace std; vector a[100]; int main() { for(int i=1;i<=200;i++) { a[1].push_back(i); } a[1].pop_back(); co]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/78327536https://blog.youkuaiyun.com/pcccccccccc/article/details/78327536pccccccccccTue, 24 Oct 2017 11:16:18 +0800 #include #include using namespace std; priority_queueq; int main() { q.push(1); q.push(2); q.push(3); while(q.size()) { cout<https://blog.youkuaiyun.com/pcccccccccc/article/details/78327500https://blog.youkuaiyun.com/pcccccccccc/article/details/78327500pccccccccccTue, 24 Oct 2017 11:14:43 +0800 #include #include using namespace std; bitset<10> a; bitset<10> b; int main() { a.set(); cout<https://blog.youkuaiyun.com/pcccccccccc/article/details/78326657https://blog.youkuaiyun.com/pcccccccccc/article/details/78326657pccccccccccTue, 24 Oct 2017 10:22:40 +0800 #include using namespace std; int main() { map< string,int > a; cout<<"插入:"<https://blog.youkuaiyun.com/pcccccccccc/article/details/78188477https://blog.youkuaiyun.com/pcccccccccc/article/details/78188477pccccccccccTue, 10 Oct 2017 08:25:30 +0800 #include #include #define Maxn (1<<20)+200005 #define Maxm 400001 using namespace std; int n,m,to[Maxn],nxt[Maxn],head[Maxn],e,val[Maxn],a[Maxm],x,y,dis[Maxn]; bool us]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/77887331https://blog.youkuaiyun.com/pcccccccccc/article/details/77887331pccccccccccThu, 07 Sep 2017 21:40:35 +0800 #include #include #include #include #define MAXN 1010001 using namespace std; int n,m,to[MAXN],nxt[MAXN],s,head[MAXN],e,pos[MAXN],dfn[MAXN],u,]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/77019047https://blog.youkuaiyun.com/pcccccccccc/article/details/77019047pccccccccccThu, 10 Aug 2017 07:59:40 +0800 #include int n,m,to[100001],nxt[100001],head[100001],e,hed,tail,dis[100001],stack[100001]; int cost[100001],x,y; bool in[100001]; using namespace std; inline void ad]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/76944033https://blog.youkuaiyun.com/pcccccccccc/article/details/76944033pccccccccccTue, 08 Aug 2017 21:03:54 +0800 #include using namespace std; int t,n,m,a[101][101],k,ans; int s1,s2,s; void get() { int pc=min(k+1,m);ans=2e9; for(int i=1;i<=pc;i++) { s=0; for(]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/76671282https://blog.youkuaiyun.com/pcccccccccc/article/details/76671282pccccccccccFri, 04 Aug 2017 11:18:00 +0800https://blog.youkuaiyun.com/pcccccccccc/article/details/76598513https://blog.youkuaiyun.com/pcccccccccc/article/details/76598513pccccccccccWed, 02 Aug 2017 21:06:19 +0800https://blog.youkuaiyun.com/pcccccccccc/article/details/76495253https://blog.youkuaiyun.com/pcccccccccc/article/details/76495253pccccccccccTue, 01 Aug 2017 09:44:33 +0800 #include using namespace std; int a[1000001],n,q[10000001],l,r,mid,m,i,j,]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/76458704https://blog.youkuaiyun.com/pcccccccccc/article/details/76458704pccccccccccMon, 31 Jul 2017 17:29:07 +0800 #include using namespace std; l]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/76262497https://blog.youkuaiyun.com/pcccccccccc/article/details/76262497pccccccccccFri, 28 Jul 2017 15:30:39 +0800 #includeusing namespace std; int n,m,to[1000001],nxt[100001],head[1000001]; int edge,dfn[100001],low[100001],xx,yy,ans,top,time; bool in[1000001]; int]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/76101700https://blog.youkuaiyun.com/pcccccccccc/article/details/76101700pccccccccccWed, 26 Jul 2017 09:07:47 +0800 using namespace std; char a[30001],b[30001]; int dp[3001][3001]; int main() { scanf("%s",a+1);scanf("%s",b+1); for(]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/75950049https://blog.youkuaiyun.com/pcccccccccc/article/details/75950049pccccccccccMon, 24 Jul 2017 08:11:56 +0800https://blog.youkuaiyun.com/pcccccccccc/article/details/75950017https://blog.youkuaiyun.com/pcccccccccc/article/details/75950017pccccccccccMon, 24 Jul 2017 07:47:43 +0800https://blog.youkuaiyun.com/pcccccccccc/article/details/75453818https://blog.youkuaiyun.com/pcccccccccc/article/details/75453818pccccccccccThu, 20 Jul 2017 09:00:58 +0800 #include using namespace std; const int N=1e5; int n,m,tot,root; struct Tree{ int l,r,ls,rs,sum,max,tag; }t[N*2]; void push_up(int x) {]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/75453498https://blog.youkuaiyun.com/pcccccccccc/article/details/75453498pccccccccccThu, 20 Jul 2017 07:47:22 +0800 #include using namespace std; int n,m,d[200001],x,y,edge,head[500001],maxn,biaohao,sum; struct node{int to,cost,nxt;}a[500001]; int team[1000001],hed,tail; bool v[50000]]>https://blog.youkuaiyun.com/pcccccccccc/article/details/73862754https://blog.youkuaiyun.com/pcccccccccc/article/details/73862754pccccccccccWed, 28 Jun 2017 18:28:11 +0800