码迷,mamicode.com
首页 >  
搜索关键字:nyoj 630 problem of    ( 39118个结果
最大团问题(Maximum Clique Problem, MCP)
概述: 最大团问题(Maximum Clique Problem, MCP)是图论中一个经典的组合优化问题,也是一类NP完全问题。最大团问题又称为最大独立集问题(Maximum Independent Set Problem)。目前,求解MCP问题的算法主要分为两类:确定性算法和启发式算法。确定性....
分类:其他好文   时间:2014-05-26 23:39:27    阅读次数:421
cas
CAS,当oldVal与expected相同时,将oldVal更新为newVal,原子操作ABA problem:when a location is read twice, has the same value for both reads, and "value is same“ is used...
分类:其他好文   时间:2014-05-26 16:06:53    阅读次数:217
Problem B Back to High School Physics
Problem B Back to High School Physics Input: standard input Output: standard output A particle has initial velocity and constant acceleration. If its ...
分类:其他好文   时间:2014-05-26 15:14:39    阅读次数:221
1003 Max Sum(动态规划)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 137169 Accepted Submission(s): 31787 Problem Des...
分类:其他好文   时间:2014-05-26 07:37:31    阅读次数:314
模拟 + 打表 --- Emag eht htiw Em Pleh
Emag eht htiw Em PlehTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2578Accepted: 1731DescriptionThis problem is a reverse case of the probl...
分类:其他好文   时间:2014-05-26 06:21:53    阅读次数:297
URAL1826. Minefield 题解
原题:http://acm.timus.ru/problem.aspx?space=1&num=18261826. MinefieldTime limit: 0.5 secondMemory limit: 64 MBTo fulfill an assignment, a reconnaissance...
分类:其他好文   时间:2014-05-24 12:57:02    阅读次数:282
(准备写)URAL1824 Ifrit Bomber 题解
http://acm.timus.ru/problem.aspx?space=1&num=18241824. Ifrit BomberTime limit: 0.5 second Memory limit: 64 MBIn the six years that passed since the fi...
分类:其他好文   时间:2014-05-24 11:46:13    阅读次数:298
ZOJ Problem Set - 1005
注意,条件:B>=C 。应考虑B=C的情况。#includeusing namespace std;int A,B,C;void jugs(int a,int b,int C){ if(b==C) { cout=B) { a=A-(B-b...
分类:其他好文   时间:2014-05-24 09:34:19    阅读次数:288
2014北京邀请赛 F Football on Table
题目来源:http://acm.bnu.edu.cn/bnuoj/problem_show.php?pid=34986题意:一个人在玩桌面足球,有m行球员,每行球员有ai个,给出每个球员的宽度和相邻球员之间的距离,球从最左边射出,给出球的起点坐标跟方向向量,问能够到达最右边的概率。思路:球员的相对位...
分类:其他好文   时间:2014-05-24 08:06:56    阅读次数:303
[ACM] hdu 1242 Rescue (BFS+优先队列)
Rescue Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: a...
分类:其他好文   时间:2014-05-23 00:06:37    阅读次数:482
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!