- 博客(3)
- 收藏
- 关注
RSS订阅原创 POJ 3104
#include #include #include #include using namespace std; const int Maxn=100010; long long a[Maxn]; long long n,k; long long ans; void erfen(long long left,long long right) { if(left>right)
2014-09-08 23:28:37
325
原创 二分，贪心，动规
A - 二分 基础 Crawling in process... Crawling failed Time Limit:15000MS Memory Limit:228000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2785 Description The
2014-07-22 15:29:22
305
原创 初学深搜广搜的总结
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 44969 Accepted: 14059 Description Farmer John has been informed of the location of a fugitiv
2014-07-14 17:06:24
499
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人