Dikea's Blog

#include using namespace std;const int maxn = 1000 + 10;const int INF = 0x3f3f3f3f;int n, m, s, t;int a[maxn];int dp[maxn][maxn];void solve(){ memset(dp, 0x3f, sizeof dp); memset(dp

The Tower of BabylonTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionPerhaps you have heard of the legend of the

Gray codeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 604    Accepted Submission(s): 357Problem DescriptionThe reflected bina

C. Dima and Saladtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima, Inna and Seryozha have gathered in a

Senior's StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 466    Accepted Submission(s): 183Problem DescriptionXuejiejie lo

PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7887 Accepted: 3915DescriptionIn Pearlania everybody is fond of pearls. One company, called The

The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8678 Accepted: 4092DescriptionFew know that the cows have their own dictionary with W (1

的BestCoder（有米！）计算直线的交点数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8881    Accepted Submission(s): 4006Problem Descr

Language:DefaultAlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14202 Accepted: 4588DescriptionIn the army, a platoon is composed by n so

CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 625    Accepted Submission(s): 325Problem DescriptionToday i

Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. Afterseveral thrilling events we find her in the first station of Algorithms City Metro, examining the ti

点击打开题目链接题解： 动态规划，首先我们要掌握动态规划的过程，在递推环节中，对某个节点进行全面的分类讨论，确定递推关系式，然后确定初始条件。#include #include #define N 30unsigned long long d[N][N];int n, k;void pre_do(){ memset(d, 0, sizeof d);

The Battle of ChibiTime Limit: 6000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 187    Accepted Submission(s): 68Problem DescriptionCao Cao m

大搬家  Accepts: 527  Submissions: 2062 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)Problem Description近期B厂组织了一次大搬家，所有人都要按照指示换到指定的座位上。

昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 42430 Accepted: 12416Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给

TelescopeTime Limit: 5 Seconds      Memory Limit: 32768 KBDr. Extreme experimentally made an extremely precise telescope to investigate extremely curious phenomena at an extremely distant pl

对于动态规划的理解 从大二起，也做了不少的动态规划题，但对于很多动态规划状态还是一知半解，究其原因，是在平时做题的过程中，不求甚解，遇到问题只是匆匆看看题解，而不深入探讨。导致很多问题都模模糊糊的过去了，做题也等于没有做。从现在开始正式的反思总结。新的一年，新的开始^_^ 1. ZOJ 1679  Telescope  题意：这道题是给出一个圆，上面有n个点，从中选出m个点，选择一种方

SubstringsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2581    Accepted Submission(s): 798Problem DescriptionXXX has an arra

CakeTime Limit: 4 Seconds      Memory Limit: 65536 KBAlice and Bob like eating cake very much. One day, Alice and Bob went to a bakery and bought many cakes.Now we know that they have boug

Wall PaintingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2048    Accepted Submission(s): 651Problem DescriptionMs.Fang love

Clarke and problem  Accepts: 169  Submissions: 372 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionClarke is a patie

New~ 欢迎参加——计算机学院大学生程序设计竞赛（新生为主） Pick The SticksTime Limit: 15000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 303    Accepted Submission(s):

Unidirectional TSPTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionBackgroundProblems that require minimum p

TourTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacat

叉乘（一）判断方向（二）判断线段相交（三）求三角形面积（一）判断方向叉乘的性质如下： 　　(1). P x Q > 0; 表示P在Q的顺时针方向; 　　(2). p x Q < 0; 表示P在Q的逆时针方向; 　　(3). P x Q = 0; 表示P和Q是共线的 P(x1,y1),Q(x2,y2), P*Q=x1y2-x2y1 判断结果三种状态模版为：struct p

#include #include #include #include #include #include #define INF 1using namespace std;int p[105],f[105][105];int min(int a, int b){    return a}int main(){    in

区间DP区间DP注意点例题：1.最优矩阵链乘2.UVA 10003 Cutting Sticks注意点区间dp与一般的dp有所区别，若使用递推的方法，需要注意根据dp[i][j] 中j-i递增的顺序来递推。例题：1.最优矩阵链乘#include #include

#include #include #include using namespace std;#define maxn 100000int p[55],dp[55][55];int main(){ int L,n; while(cin>>L&&L) { memset(dp,0,sizeof(dp)); cin>>n;

Problem H: Partitioning by PalindromesWe say a sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'racecar' is a palindrome, but 'fastcar' is not

@JintianGo 2014-11-08 10:44 字数 2396 阅读 1模板背包背包一.01背包：（每种背包零或一）二.完全背包：（每种数量不限）三.多重背包：（每种背包数量给出）四.完整程序五.例题1（POJ1276）2（UVA12653）一.01背包：（每种背包零或一

Problem FLighting System DesignInput: Standard InputOutput: Standard Output You are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation &

Language:DefaultCash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27946 Accepted: 9973DescriptionA Bank plans to install a machine for c

ICPC 2011 Asia Regional Daejeon Problem C: Color Length  The 36th Annual ACM International Collegiate Programming Contest Asia Regional - Daejeon Problem C Color Length  Cars painted in diff

Minimax TriangulationTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 820 Accepted: 255DescriptionTriangulation of surfaces has applications in the Finit

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 c

Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25965 Accepted: 7323 Special JudgeDescriptionLet us define a regular brackets seque

Happy birthday  Accepts: 178  Submissions: 511 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)问题描述今天是Gorwin的生日。所以她的妈妈要实现她的一个愿望。Gorwin说她想吃很多蛋

题目1 : 随机斐波那契时间限制:5000ms单点时限:1000ms内存限制:256MB描述大家对斐波那契数列想必都很熟悉:a0 = 1, a1 = 1, ai = ai-1 + ai-2,(i > 1)。现在考虑如下生成的斐波那契数列:a0 = 1, ai = aj + ak, i > 0, j, k从[0,

//#include //#include //#include ////using namespace std;//#define maxn 100000+10////int n, m;//bool vis[maxn];//double d[maxn];//int a[maxn];//////double dp(int k)//{//// if(vis[k]

#include #include #include #include using namespace std;#define MAX 1000010#define MAXP 700000int vis[MAX];int prime[MAXP];int n;double dp[MAX];bool flag[MAX];int primes_num;void sieve