D. Boxes Packing

链接

[http://codeforces.com/contest/1066/problem/D]

sb题

代码

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a[200010];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll i,j,k,n,m;
    cin>>n>>m>>k;
    for(i=1;i<=n;i++) cin>>a[i];
    
    ll ans=0,sum=0,cnt=0;
    for(i=n;i>=1;i--){
        if(sum+a[i]<=k) sum+=a[i];
        else cnt++,sum=a[i];
        if(cnt==m) break;
        ans++;
    }
    cout<<ans<<endl;
    return 0;
}