Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 40407 Accepted: 11367 Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large…
题目链接:http://poj.org/problem?id=3159 Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 33576 Accepted: 9422 Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought th…
转载请注明出处: http://www.cnblogs.com/fraud/ ——by fraud Candies Time Limit: 1500MS Memory Limit: 131072K Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’…
Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 39666 Accepted: 11168 题目链接:http://poj.org/problem?id=3159 Description: During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought…
#include <iostream> #include <queue> #include <cstring> #define maxn 30005 #define scanf(x) scanf("%d", &x) using namespace std; struct CNode { int next; // index of the next vector from the same vertex int k; // the end ve…