前缀和+二分查找 直接algorithm逃课

简单s了，没得讲了，直接上代码 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 先赞后看，养成习惯

#include<iostream> using namespace std; long long m[100010]; int a[100010]; int main() { int n; cin>>n; for(int i=0;i<n;i++) { cin>>a[i]; m[i]=m[i-1]+a[i]; } int k; cin>>k; while(k--) { long long t; cin>>t; int s=lower_bound(m+1,m+n+1,t)-m; if(m[s]==t) { cout<<s<<endl; } else { cout<<s-1<<endl; } } return 0; }

#include<bits/stdc++.h> using namespace std; int dp[1000001]; int n; int a[1000001]; int m; int find(int f){ for(int i=1;i<=n;i++){ if(f<dp[i]){ return i-1; } } return n; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; dp[i] = dp[i-1]+a[i]; } cin>>m; for(int i=1;i<=m;i++){ int x; cin>>x; cout<<find(x)<<endl; } }