2017暑假
追什么风筝
这个作者很懒,什么都没留下…
展开
-
CSU 1803 2016
点击打开链接 #include #include #include using namespace std; int main() { long long n,m,a[3000],b[3000],i,j; while(~scanf("%lld %lld",&n,&m)) { long long sum=0; for(i原创 2017-08-12 20:18:44 · 145 阅读 · 0 评论 -
zoj 3211 Dream city dp+贪心
JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are ntrees in the yard. Let's call them tree 1, tree 2 ...and tree n. At the first day, each tree i has ai coins on it (i=1,原创 2017-08-13 10:42:34 · 215 阅读 · 0 评论