【CF1016A】Death Note（签到）

题意：无限页的书，每页可以写m个名字，给你一个长度为n的序列，序列为你每天要写的名字数，输出你每天要翻的页数。

n<=2e5,m,a[i]<=1e9

思路：

 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<iostream>
 #include<algorithm>
 #include<map>
 #include<set>
 #include<queue>
 #include<vector>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef vector<int> VI;
 #define fi first
 #define se second
 #define MP make_pair
 #define MOD 1000000007
 #define N   210000

 ll a[N],b[N];
 ll n,m;

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 int main()
 {
       //freopen("1.in","r",stdin);
     //freopen("1.out","w",stdout);
     scanf("%d%d",&n,&m);
     for(int i=;i<=n;i++) scanf("%lld",&a[i]);
     ll now=,sum=;
     ll ans=;
     for(int i=;i<=n;i++)
     {
         if(now+a[i]<m) {now+=a[i];b[i]=ans;}
          else
          {
              a[i]-=(m-now);
              ans++;
             ans+=(a[i]/m);
             now=a[i]%m;
              b[i]=ans;
          }
     }
     for(int i=;i<=n;i++) printf("%lld ",b[i]-b[i-]);
     return ;
 }