- 博客(11)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 2014ACM/ICPC亚洲区广州站 && HDU Song Jiang's rank list （排序）
Song Jiang's rank listTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 805 Accepted Submission(s): 410Problem Description《Shui Hu Zh
2015-10-04 16:01:17
621
原创 弱校联萌十一大决战之强力热身 J. Right turn （模拟）
J. Right turnTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog is trapped in a maze. The maze is infinitely large and divided into gri
2015-10-03 17:39:04
1150
原创 弱校联萌十一大决战之强力热身 E. Rectangle （规律）
E. RectangleTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog has a piece of paper divided into n rows and m columns. Today, she would
2015-10-03 15:38:30
1170
原创 弱校联萌十一大决战之强力热身 C. Censor （KMP + stack）
C. CensorTime Limit: 2000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog is now a editor to censor so-called sensitive words (敏感词).She has a lon
2015-10-03 13:19:37
1278
原创 弱校联萌十一大决战之强力热身 B. Carries （二分）
B. CarriesTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog has n integers a1,a2,…,an, and she wants to add them pairwise.Unfortun
2015-10-02 18:18:13
1329
原创 弱校联萌十一大决战之强力热身 A. Easy Math （水）
A. Easy MathTime Limit: 2000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit StatusGiven n integers a1,a2,…,an, check if the sum of their square root √a1+√a2+⋯+
2015-10-02 17:28:04
790
原创 2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4493 Tutor （水）
TutorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3411 Accepted Submission(s): 910Problem DescriptionLilin was a student of Tonghu
2015-10-02 16:45:28
859
原创 2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4499 Cannon （搜索）
AC代码：#include using namespace std;int n, m, q;int g[10][10];int ans;void dfs(int x, int y, int cnt){ if(x >= n){ //搜索结束 ans = max(ans, cnt); return ; } if(y >=
2015-10-02 15:33:57
632
原创 UVA 10891 Game of Sum （博弈论 + 区间dp）
Game of SumTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionThis is a two player game. Initially there are n integer numbers in an array and pl
2015-10-02 14:27:39
547
原创 2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4597 Play Game （博弈 + 区间dp）
Play GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1185 Accepted Submission(s): 685Problem DescriptionAlice and Bob are playing
2015-10-02 12:59:18
901
1
原创 2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4496 D-City （并查集）
题目链接：D-City解析：一般的思路应该是先将任意两点之间不在询问中的各边连起来，然后再按照倒序将询问的边一个一个加入并查集，同时记录联通块数即可。但是，这样试了一下，老是MLE和TLE，这题能卡住这种常规的做法。因为题意没这么复杂。。。仔细读题才发现：最后会将所有的边都删去，也就是说，最后一定是n个联通块，而且所有边都删除之后，则倒着操作的起始并查集里没有有一条边。然后就可以向
2015-10-01 16:42:40
783
编译原理课程设计之编译器（完整代码 + 测试样例）
2015-07-29
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人