Print Article

Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 5519 Accepted Submission(s): 1707

Problem Description Zero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certainly wear and tear, so Zero use a cost to eva luate this degree.
One day Zero want to print an article which has N words, and each word i has a cost Ci to be printed. Also, Zero know that print k words in one line will cost

M is a const number.
Now Zero want to know the minimum cost in order to arrange the article perfectly.

Input There are many test cases. For each test case, There are two numbers N and M in the first line (0 ≤ n ≤ 500000, 0 ≤ M ≤ 1000). Then, there are N numbers in the next 2 to N + 1 lines. Input are terminated by EOF.
Output A single number, meaning the mininum cost to print the article.
Sample Input

Sample Output

Author Xnozero
Source 2010 ACM-ICPC Multi-University Training Contest（7）――Host by HIT

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       using namespace std; const int maxn=500500; int n; int q[maxn],head,tail; int dp[maxn],sum[maxn],M; int main() { while(scanf("%d%d",&n,&M)!=EOF) { head=0,tail=0,dp[0]=0,sum[0]=0; q[tail++]=0; for(int i=1;i<=n;i++) { scanf("%d",sum+i); sum[i]+=sum[i-1]; } for(int i=1;i<=n;i++) { while(head+1


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：poj1061青蛙的约会（扩展欧几里得..	下一篇：HDU3001 Travelling 状压DP

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: