排序:
默认
按更新时间
按访问量

xtu 1268 Strange Optimization 湘潭邀请赛I

Strange Optimization Bobo is facing a strange optimization problem. Given n,m, he is going to find a real number α such that f(12+α) is maximi...

2017-05-16 11:08:29

阅读数:481

评论数:0

xtu 1267 Highway 湘潭邀请赛H

Highway In ICPCCamp there were n towns conveniently numbered with 1,2,…,n connected with (n−1) roads. The i-th road connecting towns ai and ...

2017-05-16 11:06:16

阅读数:528

评论数:0

xtu 1266 Parentheses 2017湘潭邀请赛G

Parentheses Bobo has a very long sequence divided into n consecutive groups. The i-th group consists of li copies of character ci where ci is ...

2017-05-16 11:04:05

阅读数:309

评论数:0

xtu 1264 Partial Sum 2017湘潭邀请赛E

Partial Sum Bobo has a integer sequence a1,a2,…,an of length n. Each time, he selects two ends 0≤lr≤n and add |∑rj=l+1aj|−C into a counter w...

2017-05-16 11:01:10

阅读数:496

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1243 2016

http://www.dengwenhuo.cn/?id=194 Given a2×2 matrix A=(a 11 a 21  a 12 a 22  ),    findA n  whereA 1 =A,A n =A×A n−1  . As...

2016-06-20 13:44:28

阅读数:935

评论数:1

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1249 Rolling Variance

Bobo learnt that the variance of a sequencea1,a2,…,anis ∑ni=1(ai−a¯)2n−1−−−−−−−−−−−−√ where a¯=∑ni=1ain. Bobo has a sequencea1,a2,…,an, and...

2016-06-20 13:42:24

阅读数:951

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1250 Super Fast Fourier Transform

http://www.dengwenhuo.cn/?id=196 Bobo has two sequences of integers{a1,a2,…,an}and{b1,b2,…,bm}. He would like to find ∑i=1n∑j=1m⌊|ai−bj|−−−...

2016-06-20 13:41:26

阅读数:944

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1245 Hamiltonian Path

http://www.dengwenhuo.cn/?id=197 In ICPCCamp, there arencities andmdirected roads between cities. Thei-th road going from theai-th city ...

2016-06-20 13:40:01

阅读数:889

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1244 Gambling

http://www.dengwenhuo.cn/?id=199 In ICPCCamp, gambling is conducted as follow. A player will draw balls from an opaque bag containingared ball...

2016-06-20 13:38:37

阅读数:1426

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1246 Heartstone

http://www.dengwenhuo.cn/?id=201 Bobo is playing Heartstone. There arenminions in the battlefield. Thei-th minion hashihit points (HP). ...

2016-06-20 13:37:15

阅读数:1420

评论数:0

2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1252 Defense Tower

http://www.dengwenhuo.cn/?id=200 In ICPCCamp, there arencities and(n−1)(bidirectional) roads between cities. Thei-th road is between theai-th a...

2016-06-20 13:34:33

阅读数:997

评论数:0

模板收集

ll exmod[100005],rmod[100005]; ll multimod(ll a,ll b,ll mod) { ll ans = 0; for ( ; b; b >>= 1, a = (a<<1)%mod) if (b&...

2016-05-22 21:20:22

阅读数:272

评论数:0

hdu 3068 最长回文 Manacher算法

http://acm.hdu.edu.cn/showproblem.php?pid=3068 #include #include #include #include #include using namespace std; int main() { char s[2...

2016-05-01 20:02:07

阅读数:313

评论数:0

加油

Problem Description   NightGuard非常喜欢开车旅行。每年5.1节,他都要开着自己的车到一个风景比较好的地方去度假。由于路途遥远,汽车的油箱容量有限,装不下足够的汽油。NightGuard想了一个办法,自己再带上一个桶,用桶来装汽油,这样,汽油就不会不够了。   现...

2016-04-15 18:24:32

阅读数:547

评论数:0

dijkstra算法实现

#include #include using namespace std; const int maxnum = 100; const int maxint = 999999; // 各数组都从下标1开始 int dist[maxnum]; // 表示当前点到源点的最短路径长度 ...

2016-03-15 20:08:09

阅读数:245

评论数:0

hdu 5635 LCP Array

http://acm.hdu.edu.cn/showproblem.php?pid=5635 题意:给你一串数字    如 5 4 3 2 1 0 4就表示  前4个字母和从第二个开始的4个字母是一样的 也就是说 这5个字母都是一样的 再验证一下 3    从第二个开始的后3个字母 ...

2016-03-05 22:14:18

阅读数:498

评论数:0

hdu 1073 Online Judge

http://acm.hdu.edu.cn/showproblem.php?pid=1073 注意清空 #include #include #include using namespace std; int main(){ int cas; char ans1[50...

2016-03-04 13:34:19

阅读数:366

评论数:0

hd 1070 Milk

http://acm.hdu.edu.cn/showproblem.php?pid=1070 #include #include #include using namespace std; struct milk{ char name[1000]; doubl...

2016-03-04 11:39:41

阅读数:368

评论数:0

小巧妙

约瑟夫问题 #include #include int main( void ) { int n, i, m, p,t; while(~scanf("%d %d", &n, &m)) { t=1; i=...

2015-12-22 18:41:59

阅读数:323

评论数:0

poj 1786 Bridge Hands

Drivers of Advanced Cargo Movement, Ltd. usually have to wait quite a long time when waiting at border crossings for duty clearance. They are used to...

2015-12-13 18:11:02

阅读数:329

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭