qq_18661257的专栏

#ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin);#endif // ONLINE_JUDGE

EXTENDED LIGHTS OUTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9081 Accepted: 5904DescriptionIn an extended version of the game Lights Out, is a puz

The Water BowlsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5852 Accepted: 2296DescriptionThe cows have a line of 20 water bowls from which they drin

Graveyard DesignTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 6315 Accepted: 1498Case Time Limit: 2000MSDescriptionKing George has recently dec

Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23335 Accepted: 12757DescriptionSome positive integers can be represente

Bound FoundTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2897 Accepted: 888 Special JudgeDescriptionSignals of most probably extra-terrestrial ori

涂色：（日文题目，自己翻译成了中文）为了宣传信息竞赛，要在长方形的三合板上喷油漆来制作招牌。三合板上不需要涂色的部分预先贴好了护板。被护板隔开的区域要涂上不同的颜色，比如上图就应该涂上5种颜色。请编写一个程序计算涂色数量，输入数据中，保证看板不会被护板全部遮住，并且护板的边一定是水平或垂直的。输入：第一个数是宽w（1 ≤ w ≤ 1000000），第二个数是高h（1

SumsetsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10573 Accepted: 2882DescriptionGiven S, a set of integers, find the largest d such that a + b + c

SubsetTime Limit: 30000MS Memory Limit: 65536KTotal Submissions: 3193 Accepted: 570DescriptionGiven a list of N integers with absolute values no larger than 1015,

Linear worldTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3384 Accepted: 753DescriptionThe Disc, being flat, has no real horizon. Any adventurous sail

当所需是一位数组，或者是数组的大小明显小于32位的话，用二进制循环的技巧可以代替DFS繁琐的步骤for(int i = 0; i             int total = 0, Min = INF, cnt = 0;            for(int j = 0; j                 if(i >> j & 1) {                 

/*Author: 2486Memory: 4 KB Time: 78 MSLanguage: GNU G++ 4.9.2 Result: AcceptedPublic: No Yes*///ACM反转类提醒的基本模板#include #include #include #include #include using namespace std;const int

CodeForces - 315BSereja and ArrayTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionSereja has got an array, cons

Moving TablesTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThe famous ACM (Advanced Computer Maker) Company has r

J - ShaolinTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4585DescriptionShaolin temple is very famous for its Kongfu monk

玲珑杯1066 - Buy Candy(传送门) 题解就是个简单的石子合并，一般的石子合并问题我们用O(n3)O(n^3)的复杂度解决，通过平行四边形优化可以达到降低一维，实现O(n2)O(n^2)的复杂度，平行四边形优化可以解决满足如下条件的问题： dp[i][j] = min{dp[i][k]+dp[k+1][j]+w[i][j]} 我们用S[i][j]保存当前让dp[i][j]最优的