C - Increase Subarray Sums
作者:互联网
题意
给一个数组 a[n] 与整数 x ,定义 k (0<=k&&k<=n) ,每次可以操作 k 个数使其加上 x ,f(k) 为当前序列a 中最大的连续子段和,求出每一个f(k)
思路
定义数组 d[i] 为区间为 i 时最大的连续子段和,然后遍历 k ,更新 d[i] 的值,d[ i ] = min( i , k ) * x + d[ i ] ,
最后遍历 数组d 得到最大值
代码
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100002;
int main()
{
int t;
cin >> t;
while (t--)
{
int n, x;
cin >> n >> x;
int s[n + 10] = {0};
for (int i = 1; i <= n; i++)
{
cin >> s[i];
s[i] += s[i - 1];
}
int f[n + 10] ;
memset(f,-126,sizeof(f));
for (int i = 1; i <= n; i++)
{
for (int j = 1; j + i <= n + 1; j++)
{
f[i] = max(f[i], s[i + j - 1] - s[j - 1]);
}
}
for (int len = 0; len <= n; len++)
{
int mas = 0;
for (int i = 1; i <= n; i++)
mas = max(mas, f[i] + min(len, i) * x);
cout << mas<<" ";
}
cout<<endl;
}
return 0;
}
标签:10,遍历,int,Sums,cin,long,Increase,数组,Subarray 来源: https://www.cnblogs.com/gosick-ll/p/16098804.html