信奥赛CSP-J复赛集训(DP专题)(4):[USACO11JAN] Profits S
信奥赛CSP-J复赛集训(DP专题)(4):[USACO11JAN] Profits S题目描述The cows have opened a new business, and Farmer John wants to see how well they are doing. The business has been running for N (1 = N = 100,000) days, and every day i the cows recorded their net profit P_i (-1,000 = P_i = 1,000).Farmer John wants to find the largest total profit that the cows have made during any consecutive time period. (Note that a consecutive time period can range in length from one day through N days.) Help him by writing a program to calculate the largest sum of consecutive profits.奶牛们开始了新的生意
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.coloradmin.cn/o/2574343.html
如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈,一经查实,立即删除!