bestcoder
ZONE画派
正在学习计算机视觉相关
展开
-
20140912 【 拓扑排序 】 bestcoder #1+hdoj 4857 逃生
#include #include #include #include using namespace std; #define MAXN 30010 vector v[MAXN]; int n, m, cnt[MAXN], ans[MAXN]; int main(){ int T, x, y, counter; while( EOF != scanf("%d", &T)原创 2014-09-12 21:18:20 · 1043 阅读 · 0 评论 -
20140916 【 STL - 暴力 】 bestcoder #1 + hdoj 4858 项目管理
#include #include #include #include #include #include #include using namespace std; #define MAXN 100010 typedef long long LL; vector v[MAXN]; int n, m; LL sum[MAXN]; int main(){ int原创 2014-09-16 14:06:59 · 778 阅读 · 0 评论 -
20140916 【 贪心 】 bestcoder #2 + hdoj 4883 TIANKENG’s restaurant
#include #include #include using namespace std; #define MAXN 10100 #define MIN 0 struct PP{ int n, t; }a[MAXN*2]; bool cmp(const PP a, const PP b){ return a.t<b.t; } int n; int main(){原创 2014-09-16 16:00:30 · 834 阅读 · 0 评论 -
20141006 【 STL 】 bestcoder #12 So easy
Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Statu原创 2014-10-06 10:42:38 · 625 阅读 · 0 评论 -
20140929 【 树状数组 】 BestCoder Round #11 (Div. 2) Argestes and Sequence
Home Contests Notification Clarification Problems Ranklist Status HackStatus 题目已经添加到OJ题库末尾,题解放在了首页More... Argestes and Sequence Time Limit: 5000/2500 MS (Java/Others) Memory原创 2014-09-29 12:06:26 · 524 阅读 · 0 评论