题目传送门
题意: 给你一个长度小于1e6且只有’+’、’-'的字符串,给你如下程序,要求输出res。
res = 0
for init = 0 to inf
cur = init
ok = true
for i = 1 to |s|
res = res + 1
if s[i] == '+'
cur = cur + 1
else
cur = cur - 1
if cur < 0
ok = false
break
if ok
break
思路: 这个代码的时间复杂度是O(n^2)级,硬算肯定不行,我们观察到对于里层循环,每次都重复计算了cur,所以我们最开始处理一下前缀和,把里层循环优化就行了。
代码:
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define int long long
#define pii pair<int,int>
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read(){int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=gc();}
return x*f;}
using namespace std;
const int N=1e6+5;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-7;
const double PI=acos(-1);
int a[N];
signed main()
{
int T;
cin>>T;
while(T--)
{
string s;
cin>>s;
for(int i=0;i<s.size();i++)
a[i+1]=a[i]+(s[i]=='+'?1:-1);
int ans=0,pos=0,n=s.size();
for(int i=0;i<=n;i++)
{
while(a[pos]+i>=0&&pos<n)
pos++;
ans+=pos;
if(a[pos]+i>=0)
break;
}
cout<<ans<<endl;
}
}