#include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <queue> #include <list> #include <vector> #include <map> #include <set> #include <string> #include <cstring> #include <cassert> #include <limits.h> using namespace std; #define ST first #define ND second #define MP make_pair #define PB push_back typedef long long LL; typedef long double LD; typedef vector<int> VI; typedef pair<int,int> PII; #define REP(i,n) for(int i=0;i<(n);i++) #define FOR(i,a,b) for(VAR(i,a);i<=(b);++i) #define FORD(i,a,b) for(VAR(i,a);i>=(b);--i) #define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a) #define VAR(a,b) __typeof(b) a=(b) #define SIZE(a) ((int)((a).size())) #define ALL(x) (x).begin(),(x).end() #define CLR(x,a) memset(x,a,sizeof(x)) #define ZERO(x) memset(x,0,sizeof(x)) const int MAXN=200000+5; const int MAXM=1000000+5; int n, m; LL results[MAXM]; int d[MAXN]; struct interval { LL dt; LL p; bool sentry; int next; bool removed; }; interval intervals[MAXN]; LL dr=0; class intervalcmp { public: bool operator() (const int& l, const int&r) const { if (intervals[r].sentry) { return false; } return (intervals[l].p+1)*intervals[r].dt < (intervals[r].p+1)*intervals[l].dt; } }; int main() { ios_base::sync_with_stdio(0); cin>>n; cin>>m; priority_queue<int, vector<int>, intervalcmp> iq; LL ti1; LL ti=0; int i=0; intervals[0].dt=LONG_LONG_MAX/10000000; intervals[0].next=1; intervals[0].sentry=true; FOR(iii, 1, n) { ti1 = ti; cin>>ti; if (ti>ti1) { i++; intervals[i].dt=ti-ti1; intervals[i].next=i+1; } else { intervals[i+1].p += 1; } } n=i; intervals[n+1].sentry=true; intervals[n+1].dt=LONG_LONG_MAX/10000000; intervals[n+1].next=n+1; FOR(i,0,n+1) { dr = dr + (intervals[i].p+1)*intervals[i].p / 2; iq.push(i); } int maxd=0; REP(i, m) { cin >> d[i]; if (maxd<d[i]) { maxd=d[i]; } } FOR(s,1,maxd) { results[s] = results[s-1] + dr; // cout<<results[s]<<"\n"; while (true) { int top=iq.top(); interval &i0 = intervals[top]; if (i0.removed) { iq.pop(); continue; } else if (s*(i0.p+1) >= i0.dt) { // cout<<top<<"\n"; // printf("s %d i %d dt %lld p %d\n", s, top, i0.dt, i0.p); iq.pop(); interval &i1 = intervals[i0.next]; if (!i1.sentry) { i1.removed = true; } LL p = i0.p + i1.p + 1; dr = dr + (p*(p+1)-(i0.p*(i0.p+1))-(i1.p*(i1.p+1)))/2; results[s] += (s*(i0.p+1)-i0.dt)*(i1.p); results[s] += s*(i0.p+1)-i0.dt; i0.next = i1.next; i0.p = p; i0.dt = i0.dt + i1.dt; iq.push(top); } else { break; } }; } REP(i, m) { cout<<results[d[i]]<<"\n"; } return 0; }
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 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 | #include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <queue> #include <list> #include <vector> #include <map> #include <set> #include <string> #include <cstring> #include <cassert> #include <limits.h> using namespace std; #define ST first #define ND second #define MP make_pair #define PB push_back typedef long long LL; typedef long double LD; typedef vector<int> VI; typedef pair<int,int> PII; #define REP(i,n) for(int i=0;i<(n);i++) #define FOR(i,a,b) for(VAR(i,a);i<=(b);++i) #define FORD(i,a,b) for(VAR(i,a);i>=(b);--i) #define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a) #define VAR(a,b) __typeof(b) a=(b) #define SIZE(a) ((int)((a).size())) #define ALL(x) (x).begin(),(x).end() #define CLR(x,a) memset(x,a,sizeof(x)) #define ZERO(x) memset(x,0,sizeof(x)) const int MAXN=200000+5; const int MAXM=1000000+5; int n, m; LL results[MAXM]; int d[MAXN]; struct interval { LL dt; LL p; bool sentry; int next; bool removed; }; interval intervals[MAXN]; LL dr=0; class intervalcmp { public: bool operator() (const int& l, const int&r) const { if (intervals[r].sentry) { return false; } return (intervals[l].p+1)*intervals[r].dt < (intervals[r].p+1)*intervals[l].dt; } }; int main() { ios_base::sync_with_stdio(0); cin>>n; cin>>m; priority_queue<int, vector<int>, intervalcmp> iq; LL ti1; LL ti=0; int i=0; intervals[0].dt=LONG_LONG_MAX/10000000; intervals[0].next=1; intervals[0].sentry=true; FOR(iii, 1, n) { ti1 = ti; cin>>ti; if (ti>ti1) { i++; intervals[i].dt=ti-ti1; intervals[i].next=i+1; } else { intervals[i+1].p += 1; } } n=i; intervals[n+1].sentry=true; intervals[n+1].dt=LONG_LONG_MAX/10000000; intervals[n+1].next=n+1; FOR(i,0,n+1) { dr = dr + (intervals[i].p+1)*intervals[i].p / 2; iq.push(i); } int maxd=0; REP(i, m) { cin >> d[i]; if (maxd<d[i]) { maxd=d[i]; } } FOR(s,1,maxd) { results[s] = results[s-1] + dr; // cout<<results[s]<<"\n"; while (true) { int top=iq.top(); interval &i0 = intervals[top]; if (i0.removed) { iq.pop(); continue; } else if (s*(i0.p+1) >= i0.dt) { // cout<<top<<"\n"; // printf("s %d i %d dt %lld p %d\n", s, top, i0.dt, i0.p); iq.pop(); interval &i1 = intervals[i0.next]; if (!i1.sentry) { i1.removed = true; } LL p = i0.p + i1.p + 1; dr = dr + (p*(p+1)-(i0.p*(i0.p+1))-(i1.p*(i1.p+1)))/2; results[s] += (s*(i0.p+1)-i0.dt)*(i1.p); results[s] += s*(i0.p+1)-i0.dt; i0.next = i1.next; i0.p = p; i0.dt = i0.dt + i1.dt; iq.push(top); } else { break; } }; } REP(i, m) { cout<<results[d[i]]<<"\n"; } return 0; } |