lljjccsskk的专栏

题目地址：http://uva.onlinejudge.org/external/118/11809.pdf         目前花时间最长的一题……         输入方式算个小坑吧不仔细浪费了很多时间，最先想到的办法就是查表，可是做题太少还妄想用奇怪的办法，最终自己的不成熟的方法打表贡献了好几次WA。         表打好之后精度问题也让我很茫然，看了其他大神的题解直接借鉴了1e

Randy Company has N (1 ≤ N ≤ 100) storages. Company wants some men to keep them safe. Nowthere are M (1 ≤ M ≤ 30) men asking for the job. Company will choose several from them. RandyCompany empl

The BCCB (Bangladesh Cricket Control Board) has decided to build a new international cricket stadiumin Barisal. It will be convex in shape unlike others. Floodlight will be placed outside the stadium

Folding Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Bill is trying to compactly represent sequences of capit

Cellular Automaton Time Limit: 18000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description 题意： 对一个圈里的n个数字进行操作，每次操作都将数字i与其相邻距离d以内的数字加起来对m取余。共进行k次

Treblecross Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description 借鉴自：http://blog.youkuaiyun.com/yeyeyeguoguo/article/

Airport Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description 题意： 给平面上n个点，找一条直线，使得所有点在直线同侧（或直线上），且到直线距离之和尽量小。 分析： O(n)时间遍历凸包的

Bridge Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description 题意： 桥上等距离摆放着塔高为H的若干个塔，忽略宽度，相邻塔的距离不超过D，塔之间绳索形成全等的对称抛物线。桥长度为B，

Exploring Pyramids Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description Problem descriptions: System Crawler 2016-10-16

Alibaba the famous character of our childhood stories would like to be immortal in order to keepbringing happiness to children. In order to rich this status he needs to prove that he is still able t

A password locker with N digits, each digit can be rotated to 0-9 circularly.You can rotate 1-3 consecutive digits up or down in one step. For examples: 567890 → 567901 (by rotating the last 3 digi

A couple of years ago, a new world wide crisis started, leaving many people with economical problems.Some workers of a particular company are trying to ask for an increase in their salaries. The comp

stable_sort sort的应用； 1、可以传入两个参数；      sort(a,a+N) ,其中a是数组，a+N表示对a[0]至a[N-1]的N个数进行排序(默认从小到大排序)； 2、传入三个参数；      sort(a,a+N,cmp),第三个参数是一个函数 ；      如果让函数从大到小排序，可以用如下算法实现；       bool cmp(int a,in

代码比较简洁，记录一下。

此题与之前food delivery同为区间dp，但是我依然没有想到…… 大致题意为题目提供了n个party，每个party对应一件衣服。由于party对衣服有要求，所以要按穿要求的衣服。衣服穿上可以脱下，但不能再穿回去，若要穿上需要算一套新衣服。求符合party要求情况下的衣服最小件数。 说说思路： 在不知其他party情况下，假设在i到j个party之间衣服件数为dp[i][j]，则

刷刘汝佳的时候半天没看懂题，看了大神题解：http://blog.youkuaiyun.com/keshuai19940722/article/details/9752217 题意大致明白了，为了加深理解，特意给代码加上注释（虽然大神已经写的浅显易懂orz）。 Bandwidth Time Limit: 3000MS   Memory Limit: Unknown   64bit

Headmaster's Headache The headmaster of SpringField School is consider-ing employing some newteachers for certain subjects.There are a number of teach-ers applying for the posts.Each teacher is

Twenty Questions Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Consider a closed world and a set of features tha

10618 题意繁复，见紫书P291 本题条件比较复杂，是情况比较多的多维dp，个人认为难点在处理各阶段关系上。 看了紫书详细的解释，将各状态下的决策结果通过构造函数计算出来即可。记录一下，以后温习直接翻书。#include #include #include #include #include #include #include #include #include #in

Recurrences Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description 题意： 考虑线性递推关系f(n)=a1*f(n-1)+a2*f(n-2)+a3*f(n-3)+...+ad*f(n-d)，