好消息，坏消息

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=2e6+7;
ll val[maxn],sum[2*maxn],q[maxn];
ll n,minn,ans,head,tail;
int main(){
  cin>>n;
  minn=2147483647;head=1;tail=0;
  for(ll i=1;i<=n;i++) cin>>val[i];
  for(ll i=1;i<=n-1;i++) val[i+n]=val[i];
  for(ll i=1;i<=2*n-1;i++) sum[i]=sum[i-1]+val[i];
  for(ll i=1;i<=2*n-1;i++){
    while(head<=tail&&max(i-n+1,(ll)1)>q[head]) head++;
    while(head<=tail&&sum[i]<=sum[q[tail]]) tail--;
    q[++tail]=i;
    if(i-n+1>0&&sum[q[head]]-sum[i-n]>=0) ans++;
  }
  cout<<ans<<endl;
  return 0;
}

错误的，不知道

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
ll val[maxn],sum[2*maxn],q[maxn];
ll n,minn,ans,head,tail;
int main(){
  cin>>n;
  minn=2147483647;head=1;tail=0;
  for(int i=1;i<=n;i++) cin>>val[i];
  for(int i=1;i<=n;i++) {sum[i]=sum[i-1]+val[i];if(i!=n) sum[i+1]=sum[i];minn=min(minn,sum[i]);}
  for(int i=1;i<=n;i++) cout<<sum[i]<<" "; cout<<endl;
  q[++tail]=1;
  for(int i=2;i<=n;i++){
      while(sum[i]<=sum[q[tail]]&&head<tail) tail--;
      q[++tail]=i;
  }for(int i=head;i<=tail;i++) cout<<q[i]<<" "; cout<<endl;
  for(int k=1;k<=n;k++){
      while(q[head]<=k&&head<tail) head++;
      if(sum[ k]<=sum[q[head]]) ans++;
      while(sum[k]<=sum[q[tail]]&&head<= tail) tail--;
      q[++tail]=k+n;
      cout<<"q "<<head<<" "<<tail<<endl;
      for(int i=head;i<=tail;i++) cout<<sum[q[i]]<<" "; cout<<endl;  
  } 
  cout<<ans<<endl;
  return 0;
}