代码改变世界，keep coding。

点击打开链接We Love MOE GirlsTime Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 282    Accepted Submission(s): 207Problem DescriptionChika

A. Jzzhu and Childrentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n children in Jzzhu's school

点击打开链接A. Valera and Xtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera is a little boy. Yesterda

A. Anton and Letterstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Anton has found a set. The s

A. Devu, the Singer and Churu, the Jokertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu is a renowned

点击打开链接A. Nutstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a nuts and lots of boxes. T

点击打开链接A. Line to Cashiertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vasya went to the supe

点击打开链接A. Gravity Fliptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Chris is bored during his

#include#include#include#define ll __int64#define M 100007using namespace std;struct node{ ll l,r,mid,val,mark;}tree[M<<2];ll s[M];void build(ll left,ll right,ll i)//建树{ tree[i].l=l

最小费用最大流 模版一、最小费用最大流的模型在保证流量最大的前提下，所需的费用最小，这就是最小费用最大流问题． 带有费用的网络流图： G=（V，E，C，W）V：顶点； E：弧；C：弧的容量；W：单位流量费用。任意的弧对应非负的容量c[i，j]和单位流量费用w[i，j]。满足：① 流量f是G的最大流。② 在f是G的最大流的前提下，流的费用最小。

/*覆盖i，要么是父节点覆盖，要么是自己，要么是孩子，所以三种状态（和上面的对应）： 1、点i自己覆盖自己，i的所有孩子都覆盖，用dp[i][0]表示； 2、点i被自己的孩子覆盖，i和i的所有孩子都覆盖，用dp[i][1]表示； 3、点i被父节点覆盖，i的所有孩子都覆盖，用dp[i

#include#include#include#define MAX 26//Trie的数据结构定义typedef struct Trie { Trie *next[MAX]; int v; //根据需要变化}; Trie *root;//生成字典树void createTrie(char *str){ int l

点的标号必须是0到n-1必须去除到自身的边，到自身的边的权为无穷大#include#include#include#define M 1007#define inf 0x3f3f3fusing namespace std;int pre[M],vis[M],id[M];int in[M];int n,m;struct Node//建立邻接表{ int u,

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;const int INF = 0x3f3f3f3f;/** 求 无向图的割点和桥

最小生成树有两种模板，都比较简单。prime算法：#include#include#define MAX 99999999int g[110][110];int n;int prim(){ int low[110]; int flag[110]; memset(flag,0,sizeof(flag)); for(int i=1; i<=n

点击打开链接A. Vanya and Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya loves playing. He even

点击打开链接A. Little Pony and Expected Maximumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTw

A. Valera and Antique Itemstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera is a collector. Once he w

点击打开链接 The Donkey of Gui ZhouTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 309    Accepted Submission(s): 119Problem Descripti

点击打开链接公共因子Time Limit: 1000MS Memory limit: 65536K题目描述   假设字符串也有因数，一个字符串为s1，然后可以由n个字符串s2来表示，则称s2是s1的因数。   如“ac”是“acac”的因数。    给两个字符串，求它们的公因数有多少个。 输入 多组数据，给

Rescue The Princess Time Limit: 1000MS    Memory limit: 65536K 题目描述    Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a p

点击打开链接Cut the CakeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 294    Accepted Submission(s): 129Problem DescriptionM

Dinner时间限制: 1000 ms　内存限制: 32768 K问题描述Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, knife an

点击打开链接Secret NumberTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7398    Accepted Submission(s): 3138Problem Description

聪明的猴子Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1123    Accepted Submission(s): 294Problem Description森林中有一排香蕉树（无限长），一只猴子站在

点击打开链接Happy ReversalTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld      Java class name: MainPrev Submit Status Statistics Discuss NextFont Size: +

逃生Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569    Accepted Submission(s): 154Problem Description糟糕的事情发生啦，现在大家都忙着逃命。但是逃命的通

Couple doubiTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 674    Accepted Submission(s): 483Problem DescriptionDouBiXp has a g

TIANKENG’s restaurantTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 600    Accepted Submission(s): 280Problem DescriptionTIANK

A. DZY Loves Hashtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY has a hash table with p buckets, numbe

n a^o7 !Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happine

点击打开链接C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as

求最大匹配数，匈牙利算法：#include#includeusing namespace std;int n;int link[1007],g[1007][1007];bool vis[1007];bool find(int i){ for(int j=1;j<=n;j++) if(g[i][j]&&!vis[j]) { vis[j]=tr