HDU 3507 Print Article

斜率优化入门题。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<deque>
#include<cmath>
#include<cstring>
#include<utility>
using namespace std;
const int maxn = 5e5;
int n, m, dp[maxn + 5], sum[maxn + 5], arr[maxn + 5];
deque<int> q;
inline int G(int k, int j) {
    return ((dp[j] + sum[j] * sum[j]) - (dp[k] + sum[k] * sum[k]));
}
inline int F(int k, int j) {
    return sum[j] - sum[k];
}
int main(void)
{
    while (~scanf("%d %d", &n, &m)) {
        memset(sum, 0, sizeof(sum));
        memset(dp, 0, sizeof(dp));
        q.clear();
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &arr[i]);
            sum[i] = sum[i - 1] + arr[i];
        }
        q.push_back(0);
        for (int i = 1; i <= n; ++i) {
            while (q.size() >= 2 && G(q[0], q[1]) &