描绘自己的王国……

#include #include #include #include using namespace std;#define MAXN 30010vector v[MAXN];int n, m, cnt[MAXN], ans[MAXN];int main(){ int T, x, y, counter; while( EOF != scanf("%d", &T)

#include #include #include #include #include #include #include using namespace std;#define MAXN 100010typedef long long LL;vector v[MAXN];int n, m;LL sum[MAXN];int main(){ int

#include #include #include using namespace std;#define MAXN 10100#define MIN 0struct PP{ int n, t;}a[MAXN*2];bool cmp(const PP a, const PP b){ return a.t<b.t; }int n;int main(){

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

HomeContestsNotificationClarificationProblemsRanklistStatusHackStatus题目已经添加到OJ题库末尾，题解放在了首页More...Argestes and SequenceTime Limit: 5000/2500 MS (Java/Others)    Memory