码迷,mamicode.com
首页 >  
搜索关键字:ural 1809    ( 1009个结果
ural 1249. Ancient Necropolis
1249. Ancient NecropolisTime limit: 5.0 secondMemory limit: 4 MBAerophotography data provide a bitmap picture of a hard-to-reach region. According to ...
分类:其他好文   时间:2015-12-26 11:28:01    阅读次数:172
ural 1143. Electric Path
1143. Electric PathTime limit: 1.0 secondMemory limit: 64 MBBackgroundAt the team competition of the 10th national student informatics Olympic, which ...
分类:其他好文   时间:2015-12-26 10:05:05    阅读次数:199
ural 1073. Square Country
1073. Square CountryTime limit: 1.0 secondMemory limit: 64 MBThere live square people in a square country. Everything in this country is square also. ...
分类:其他好文   时间:2015-12-25 21:02:15    阅读次数:223
ural 1075. Thread in a Space
1075. Thread in a SpaceTime limit: 1.0 secondMemory limit: 64 MBThere are three points in a 3-dimensional space:A,BandC. All the coordinates of the po...
分类:其他好文   时间:2015-12-25 20:59:35    阅读次数:178
ural 1071. Nikifor 2
1071. Nikifor 2Time limit: 1.0 secondMemory limit: 64 MBNikifor has a numberx. He doesn't need it. He needs a numbery. Nikifor tries to obtain the req...
分类:其他好文   时间:2015-12-25 20:54:59    阅读次数:217
ural 1070. Local Time
1070. Local TimeTime limit: 1.0 secondMemory limit: 64 MBSoon the USU team will go to Vancouver to participate in the final of the ACM International C...
分类:其他好文   时间:2015-12-25 20:54:23    阅读次数:229
ural 1069. Prufer Code
1069. Prufer CodeTime limit: 0.25 secondMemory limit: 8 MBA tree (i.e. a connected graph without cycles) with vertices is given (N≥2). Vertices of the...
分类:其他好文   时间:2015-12-25 20:48:43    阅读次数:189
ural 1072. Routing
1072. RoutingTime limit: 1.0 secondMemory limit: 64 MBThere is a TCP/IP net of several computers. It means that:Each computer has one or more net inte...
分类:其他好文   时间:2015-12-25 20:46:36    阅读次数:218
URAL 1252 ——Sorting the Tombstones——————【gcd的应用】
Sorting the TombstonesTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1252DescriptionThere is time to throw...
分类:其他好文   时间:2015-12-18 18:01:08    阅读次数:247
URAL 1183 Brackets Sequence DP 路径输出
题意:长度小于100的字符串s只由四种字符"()[]"组成,求以该串为子串的最短的合法串。合法串递归定义为:(1)空串合法(2)如果S合法,则(S)、[S]合法(3)如果A、B合法,则AB合法思路:设dp[i][j]为s(i,j)变为合法串后,合法串的长度或需要添加的字符的个数,状态转移:(1)如果...
分类:其他好文   时间:2015-12-14 06:49:00    阅读次数:247
1009条   上一页 1 ... 48 49 50 51 52 ... 101 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!