#include<cstdio> using namespace std; typedef long long LL; #define REP(i,a,b) for(int i=a; i<=b; ++i) const int MAX_N = 5e5; LL wys[MAX_N], d, b, last_d = 0, wyn = 0; int a[MAX_N], n, m; LL min(LL a, LL b) { return (a<b) ? a : b ; } LL max(LL a, LL b) { return (a>b) ? a : b ; } int main() { scanf( "%d %d", &n, &m ); REP(i,0,n-1) { scanf( "%d", &a[i] ); } while( m ) { scanf( "%lld %lld", &d, &b ); REP(i,0,n-1) { wys[i] += ( d - last_d ) * a[i]; } REP(i,0,n-1) { wyn += max( 0, wys[i] - b ); wys[i] = min( b, wys[i] ); } printf( "%lld\n", wyn ); wyn = 0; last_d = d; --m; } 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 | #include<cstdio> using namespace std; typedef long long LL; #define REP(i,a,b) for(int i=a; i<=b; ++i) const int MAX_N = 5e5; LL wys[MAX_N], d, b, last_d = 0, wyn = 0; int a[MAX_N], n, m; LL min(LL a, LL b) { return (a<b) ? a : b ; } LL max(LL a, LL b) { return (a>b) ? a : b ; } int main() { scanf( "%d %d", &n, &m ); REP(i,0,n-1) { scanf( "%d", &a[i] ); } while( m ) { scanf( "%lld %lld", &d, &b ); REP(i,0,n-1) { wys[i] += ( d - last_d ) * a[i]; } REP(i,0,n-1) { wyn += max( 0, wys[i] - b ); wys[i] = min( b, wys[i] ); } printf( "%lld\n", wyn ); wyn = 0; last_d = d; --m; } return 0; } |