#include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; const int INFTY=20000000; const int MAX=200100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } //------------------------------------------ int n; ll t[MAX],d[MAX]; ll ans[5*MAX]; ll count(ll d){ ll last=0; ll S=0; loop(i,0,n){ last=max(last+d,t[i]); S+=max(0LL,last-t[i]); } return S; } int main(){ ios_base::sync_with_stdio(0); int m; cin>>n>>m; loop(i,0,n){ cin>>t[i]; } loop(i,0,5*MAX) ans[i]=-1; loop(i,0,m){ cin>>d[i]; if(ans[d[i]]==-1) ans[d[i]]=count(d[i]); pln(ans[d[i]]); } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 | #include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; const int INFTY=20000000; const int MAX=200100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } //------------------------------------------ int n; ll t[MAX],d[MAX]; ll ans[5*MAX]; ll count(ll d){ ll last=0; ll S=0; loop(i,0,n){ last=max(last+d,t[i]); S+=max(0LL,last-t[i]); } return S; } int main(){ ios_base::sync_with_stdio(0); int m; cin>>n>>m; loop(i,0,n){ cin>>t[i]; } loop(i,0,5*MAX) ans[i]=-1; loop(i,0,m){ cin>>d[i]; if(ans[d[i]]==-1) ans[d[i]]=count(d[i]); pln(ans[d[i]]); } } |