上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 31 下一页
摘要: Just a Hook In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecut 阅读全文
posted @ 2017-08-10 14:00 joeylee97 阅读(206) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include #include #include #include #include using namespace std; typedef long long LL; #define MAXN 50009 #define N 25 #define INF 0x3f3f3f3f int t, n, a[MAXN]; struct nod... 阅读全文
posted @ 2017-08-10 11:07 joeylee97 阅读(149) 评论(0) 推荐(0) 编辑
摘要: Each of Farmer John's N cows (1 ≤ N ≤ 1,000) produces milk at a different positive rate, and FJ would like to order his cows according to these rates 阅读全文
posted @ 2017-08-09 19:21 joeylee97 阅读(410) 评论(0) 推荐(0) 编辑
摘要: Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 37069 Accepted: 20612 Description Stockbrokers are known to overreact 阅读全文
posted @ 2017-08-09 18:36 joeylee97 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he 阅读全文
posted @ 2017-08-09 16:36 joeylee97 阅读(190) 评论(0) 推荐(0) 编辑
摘要: 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否 阅读全文
posted @ 2017-08-08 16:45 joeylee97 阅读(139) 评论(0) 推荐(0) 编辑
摘要: SPF Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9317 Accepted: 4218 Description Consider the two networks shown below. Assuming that da 阅读全文
posted @ 2017-08-08 15:33 joeylee97 阅读(161) 评论(0) 推荐(0) 编辑
摘要: time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Palindromic characteristics of string s  阅读全文
posted @ 2017-08-08 11:47 joeylee97 阅读(267) 评论(0) 推荐(0) 编辑
摘要: time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit per test 2 seconds time limit 阅读全文
posted @ 2017-08-08 11:15 joeylee97 阅读(389) 评论(0) 推荐(0) 编辑
摘要: Given a sequence of integers, a1, a2, . . . , an, we define its sign matrix S such that, for 1 ≤ i ≤ j ≤ n, Sij = “ + ” if ai + . . . + aj > 0; Sij = 阅读全文
posted @ 2017-08-07 20:29 joeylee97 阅读(219) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 31 下一页