- 博客(67)
- 收藏
- 关注
RSS订阅原创 1050 循环数组最大子段和
题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1050本题的最大子段和分为两种情况：（1）正常情况下的最大子段和（2）首尾元素相接情况下的最大子段和。导致第二种情况的原因是数组中存在一段负数和，且其绝对值很大。这样我们便可以求解出这段负数和，然后用总的和减去这段负数和，剩下的那些元素和即为我
2015-05-31 11:57:09
390
原创 1042 数字0-9的数量
给出一段区间a-b，统计这个区间内0-9出现的次数。比如 10-19，1出现11次（10,11,12,13,14,15,16,17,18,19,其中11包括2个1)，其余数字各出现1次。Input两个数a,b（1 OutPut输出共10行，分别是0-9出现的次数Input示例10 19Output示例1111111
2015-05-30 19:37:00
1029
原创 Kundu and Tree
Problem StatementRussianChineseKundu是树的一个真正爱好者。树是一个包含N个点和N-1条边的连通图。今天，当他得到一棵树的时候，他给每条边涂上红色(‘r’)和黑色（’b’)之中的一种颜色。他有兴趣知道有多少个节点的三元组(a,b,c)满足在节点a到节点b、节点b到节点c和节点c到节点a的路径上，每条路径都至少有一条边是红色的。 请注
2015-05-29 15:55:30
625
原创 Minimum Average Waiting Time
Problem StatementTieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply m
2015-05-29 12:02:37
1369
原创 Find Median
Problem StatementThe median of a finite list of numbers can be found by arranging all the integers from lowest to highest value and picking the middle one. For example, the median of {3,3,5,9,
2015-05-29 09:45:51
566
原创 Truck Tour
Problem StatementSuppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N−1) (both inclusive). You have two pieces of information corresponding
2015-05-28 11:32:15
1149
原创 Python 学习笔记一
1、'/' performs float division and '//' performs integer division>>> from __future__ import division>>> print 4/31.3333333333333333 >>> print 4//312、One of the built-in functions of P
2015-05-27 20:57:15
470
原创 1289 大鱼吃小鱼
1289 大鱼吃小鱼题目来源： Codility基准时间限制：1 秒 空间限制：131072 KB 分值: 5 难度：1级算法题 收藏 关注有N条鱼每条鱼的位置及大小均不同，他们沿着X轴游动，有的向左，有的向右。游动的速度是一样的，两条鱼相遇大鱼会吃掉小鱼。从左到右给出每条鱼的大小和游动的方向（0表示向左，1表示向右）。问足够长的
2015-05-27 19:44:08
1604
原创 128 Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3
2015-05-27 18:05:37
450
原创 1091 线段的重叠
X轴上有N条线段，每条线段包括1个起点和终点。线段的重叠是这样来算的，[10 20]和[12 25]的重叠部分为[12 20]。给出N条线段的起点和终点，从中选出2条线段，这两条线段的重叠部分是最长的。输出这个最长的距离。如果没有重叠，输出0。Input第1行：线段的数量N(2 <= N <= 50000)。第2 - N + 1行：每行2个数，线段的起点和终点
2015-05-27 11:53:21
999
原创 510A Fox And Snake
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m; cin >> n >> m; for(int i = 1; i <= n; ++i) {
2015-05-25 12:20:36
460
原创 443A - Anton and Letters
#include #include #include #include #include #include #include #include #include using namespace std;bool mark[30];int main() { //freopen("aa.in", "r", stdin); int cnt = 0; c
2015-05-25 12:08:02
1204
原创 448A - Rewards
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a1, a2, a3, b1, b2, b3; int n; int num; cin >> a1 >> a
2015-05-25 11:59:38
495
原创 469A - I Wanna Be the Guy
#include #include #include #include #include #include #include #include #include using namespace std;bool mark[110];int main() { int n, cnt = 0; int p, q, x; memset(mark, fals
2015-05-25 11:45:44
599
原创 492A - Vanya and Cubes
#include #include #include #include #include #include #include #include #include using namespace std;int arr[201], sum[201];int main() { arr[0] = 0; for(int i = 1; i < 201; ++i) {
2015-05-25 11:30:11
470
转载 求两个有序数组的中位数-算法导论
QuestionThere are 2 sorted arrays A and B of size n each. Write an algorithm to find the median of the array obtained after merging the above 2 arrays(i.e. array of length 2n). The complexity shou
2015-05-25 11:19:07
1100
原创 479A - Expression
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a, b, c; cin >> a >> b >> c; int t1 = a + b + c; int t
2015-05-25 10:55:07
751
原创 141A - Amusing Joke
#include #include #include #include #include #include #include #include #include using namespace std;int a[30], b[30];int main() { //freopen("aa.in", "r", stdin); string s1, s2,
2015-05-25 10:47:42
453
原创 478A - Initial Bet
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a[5]; cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]; int t
2015-05-25 10:25:39
570
原创 69A - Young Physicist
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a1, a2, a3; int b1, b2, b3; int n; cin >> n; a1
2015-05-25 10:19:17
623
原创 UVA 208 Firetruck
用dfs搜索所有路径即可，注意一点的是如果1到N是不连通的，我们就没有必要枚举所有路径了。#include #include #include #include #include #include #include #include #include using namespace std;const int maxn = 1010;struct Edge {
2015-05-25 09:22:14
352
原创 208A - Dubstep
#include #include #include #include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); string s1; string s2 = "";
2015-05-22 16:12:50
453
原创 268A - Games
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n; int color[30][2]; cin >> n; for(int i = 0; i < n; +
2015-05-22 15:36:55
442
原创 61A - Ultra-Fast Mathematician
#include #include #include #include #include #include #include #include #include using namespace std;int main() { string s1; string s2; cin >> s1 >> s2; int len = s1.length
2015-05-22 15:31:03
553
原创 500A - New Year Transportation
#include #include #include #include #include #include #include #include #include using namespace std;const int maxn = 30010;int n, t;struct Edge { int u, v, next; Edge() {} E
2015-05-22 15:23:17
379
原创 344A - Magnets
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, x, y; int cnt = 0; cin >> n; for(int i = 0; i < n;
2015-05-22 15:12:35
469
原创 486A - Calculating Function
#include #include #include #include #include #include #include #include #include using namespace std;int main() { long long n, ans; cin >> n; ans = n / 2; if(n%2) ans -= n;
2015-05-22 15:05:16
455
原创 451A - Game With Sticks
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, x; cin >> n >> m; x = min(n, m); if(x % 2 == 0)
2015-05-22 15:02:14
415
原创 144A - Arrival of the General
#include #include #include #include #include #include #include #include #include using namespace std;int a[110];int main() { int n; int ans = 0; int maxh = 0, minh = 1000000;
2015-05-22 11:57:45
599
原创 41A Translation
#include #include #include #include #include #include #include #include #include using namespace std;int main() { string s1, s2; cin >> s1 >> s2; int l1 = s1.length(); int
2015-05-22 11:40:10
534
原创 266B - Queue at the School
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, t; string str; cin >> n >> t; cin >> str; while
2015-05-22 11:23:35
641
原创 228A - Is your horseshoe on the other hoof?
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int s[4]; int ans = 0; cin >> s[0] >> s[1] >> s[2] >> s[3];
2015-05-22 11:09:47
407
原创 263A - Beautiful Matrix
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int x, y, z; for(int i = 1; i <= 5; ++i) { for(int j = 1;
2015-05-22 10:57:44
415
原创 136A - Presents
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int arr[110], ans[110]; int n; cin >> n; for(int i = 1; i
2015-05-22 10:52:14
352
原创 460A - Vasya and Socks
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, ans = 0; cin >> n >> m; while(n >= m) { ans
2015-05-22 10:41:35
363
原创 472A - Design Tutorial: Learn from Math
#include #include #include #include #include #include #include #include #include using namespace std;bool check(int n) { for(int i = 2; i * i <= n; ++i) { if(n % i == 0) return
2015-05-22 10:29:22
665
原创 379A - New Year Candles
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a, b; int ans = 0; cin >> a >> b; ans = a; while(
2015-05-22 10:07:56
395
原创 122A - Lucky Division
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n; int i = 0; cin >> n; for(i = 1; i <= n; ++i) {
2015-05-22 09:39:00
653
原创 271A Beautiful Year
#include #include #include #include #include #include #include #include #include using namespace std;bool mark[10];int main() { int n; cin >> n; while(true) { ++n;
2015-05-22 09:33:33
534
原创 58A - Chat room
#include #include #include #include #include #include #include #include #include using namespace std;int main() { int i, j = 0; string s1 = "hello"; string s2; cin >> s2;
2015-05-22 09:25:50
684
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人