题意:
一组数,求最大的长度不超过K的子段的数值和。
思路:
算法课作业题,按理说应该要很快切,结果甚至自以为是的写了个滑窗假算法(还过了...),被HD大佬(吊人)告知后才发现。于是想了个单调队列的做法,应该是正解.虽然一般不记水题,但羞耻max以至于想记下来.
处理前缀和sum,最大的子段和即 sumj - sumi-1 的差要最大.那么枚举j,对于每一个j找到合法的i且 sumi-1 最小,用这个差尝试更新答案.找i的过程用单调队列可以O(1)做到.总之就是用单调队列把n2的枚举优化为n.
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cstring>
#include<cmath>
#include<functional>
#include<climits>
#include<string>
#define dd(x) cout<<#x<<" = "<<x<<" "
#define de(x) cout<<#x<<" = "<<x<<"\n"
#define Clear(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef vector<int> V;
typedef map<int,int> M;
typedef set<int> S;
typedef queue<int> Q;
typedef priority_queue<int> BQ;
typedef priority_queue<int,vector<int>,greater<int> > SQ;
const int maxn=1e5+10,mod=1e9+7,INF=0x3f3f3f3f;
int sum[maxn],q[maxn],h,t;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for (int i=1;i<=n;++i)
{
int x;
scanf("%d",&x);
sum[i]=sum[i-1]+x;
}
int ans=-INF,ansl,ansr;
for (int i=1;i<=n;++i)
{
while (h<t&&i-q[h]+1>k)
++h;
while (h<t&&sum[i-1]<sum[q[t-1]-1])
--t;
q[t++]=i;
if (h<t&&sum[i]-sum[q[h]-1]>ans)
ans=sum[i]-sum[q[h]-1],ansl=q[h],ansr=i;
}
printf("%d %d %d",ans,ansl,ansr);
return 0;
}
(希望这份不是假算法了,毕竟那10个点太水了)