cstdio

507 - Jill Rides Again

描述：求连续数列的最大和，如果存在和相等的，那么选取所跨区间大的，如果所跨区间一样大，则选取开始位置小的，结果因为输出时缺少一个字母“T”，结果wa那么多次…… #include <cstdio
·2015-11-12 23:52

POJ 3061 Subsequence

扫描过一遍后，取最小值即可 #include <iostream> #include<cstdio> using
·2015-11-12 23:18

NYOJ 613 免费馅饼

即得到最大值 #include <iostream> #include <cstdio> #include &l
·2015-11-12 23:16

POJ 3279 Fliptile

开关问题 #include <iostream> #include<cstring> #include<cstdio> #define MAX_N 20
·2015-11-12 23:14

POJ 3684 Physics Experiment

就当它去穿过处理就可以了 #include <iostream> #include <cmath> #include <algorithm> #include <cstdio
·2015-11-12 23:13

POJ 2991 Crane

id=2991 《挑战程序设计竞赛》 人民邮电出版社 #include <iostream> #include <cmath> #include <cstdio>
·2015-11-12 23:12

cf C. New Year Ratings Change

contest/379/problem/C 思路：先排序，然后判断如果rating>ans，ans=rating否则ans++;然后对应的位置输出就可以； 1 #include <cstdio
·2015-11-12 23:01

hdu 5124 lines

1 #include <cstdio>
·2015-11-12 23:00

cf D. Maximum Submatrix 2

1 #include <cstdio
·2015-11-12 23:59

hdu 3400 Line belt

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:58

hdu 1576 A/B

1 #include <cstdio>
·2015-11-12 23:54

hdu How many integers can you find

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-12 23:53

hdu Co-prime

在1到n之间是c倍数的个数为n/c； 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-12 23:52

cf B. I.O.U.

http://codeforces.com/contest/376/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-12 23:49

cf C. Inna and Dima

1 #include <cstdio> 2 #include <cstring> 3 #include <a
·2015-11-12 23:48

cf B. Inna and Nine

http://codeforces.com/contest/374/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-12 23:48

cf C. Counting Kangaroos is Fun

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-12 23:47

cf B. Making Sequences is Fun

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define LL
·2015-11-12 23:46

cf C. Bits

problem/C 利用位运算来解决这个题，从L开始，从每一位按位或，知道到达r位置，ans=ans|(1<<k);就可以为每一位增加一个1. 1 #include <cstdio
·2015-11-12 23:45

cf D. Vessels

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:45

cf C. Hamburgers

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-12 23:44

zoj 3787 Access System

problemId=5274 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-12 23:40

zoj 3785 What day is that day?

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define LL
·2015-11-12 23:40

hdu 4550 卡片游戏

pid=4550 贪心 1 #include <cstdio> 2 #include <cstring> 3 #include <queue>
·2015-11-12 23:39

zoj 3758 Singles' Day

1 #include <cstdio> 2 #include <cstring> 3 #define LL unsigned long long 4 u
·2015-11-12 23:39

hdu 4507 吉哥系列故事——恨7不成妻

数位dp 1 #include <cstdio> 2 #include <cstring> 3 #includ
·2015-11-12 23:38

hdu 4545 魔法串

pid=4545 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:38

zoj 3778 Talented Chef

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:38

hdu 3709 Balanced Number

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4
·2015-11-12 23:37

hdu 3652 B-number

1 #include <cstdio> 2 #include <cs
·2015-11-12 23:36

hdu 2089 不要62

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define ll
·2015-11-12 23:36

hdu 3555 Bomb

pid=3555 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:35

hdu 4658 Integer Partition

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:34

zoj 3647 Gao the Grid

1 #include <cstdio> 2 #include <cstring> 3 #include <
·2015-11-12 23:33

hdu 2197 本原串

1 #include <cstdio> 2 #include <
·2015-11-12 23:33

poj 1151 Atlantis

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #defi
·2015-11-12 23:32

poj2352 Stars

id=2352 1 #include <cstdio> 2 #include <cstring> 3 #define maxn 400000 4 using
·2015-11-12 23:31

poj 2892 &&hdu 1540 Tunnel Warfare

id=2892 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:31

poj 3468 A Simple Problem with Integers

id=3468 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:30

poj 3264 Balanced Lineup

id=3264 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:29

poj 3368 Frequent values

id=3368 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #
·2015-11-12 23:29

poj 3686 The Windy's

id=3686 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:28

poj 3308 Paratroopers

id=3308 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:27

poj 3352 Road Construction

id=3352 1 #include <cstdio> 2 #include <iostream> 3 #include <cstring>
·2015-11-12 23:26

poj 3114 Countries in War

id=3114 1 #include <cstdio> 2 #include <cstring> 3 #include <queue>
·2015-11-12 23:26

poj 3592 Instantaneous Transference

id=3592 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:25

poj 2186 Popular Cows

id=2186 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:24

poj 1195Mobile phones

id=1195 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:23

poj 3694 Network

id=3694 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:23

poj 2886Who Gets the Most Candies?

id=2886 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-12 23:22
上一页 37 38 39 40 41 42 43 44 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他