2016 年 4月 14 日随笔档案 - Pat

2016年4月14日

摘要： Pat Lost Boy Calling 。。。。 DLUTOJ 1331 Maximum Sum 传送门 Time Limit: 1 Sec Memory Limit: 128 MB Description You are given an array of size N and another integer M.Your target is to find the maximum value of sum of subarray modulo M. Subarray is a continous subset of array elements. Note that we need to find the maximum value of (Sum of Subarray)%M , where there are N*(N+1)/2 possible subarrays. Input First line contains T , number of test cases to follow. Each test case consits of exactly 2 阅读全文

posted @ 2016-04-14 19:05 Pat 阅读(453) 评论(0) 推荐(0) 编辑

Pat

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。

公告

Pat

「以解决问题为乐」 真的喜欢么？真的喜欢就去做吧。 Lost Boy Calling 。。。。 ... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code. This is an obscurity that catches the unwary. 原来我什么都不懂。

公告

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。