[題解] f481

#include <iostream>
#include <vector>

using namespace std;

int lowerbound(int arr[],int N,int X){
    int low=0;
    int high=N-1;
    int mid;
    while(low<high){
        mid=low+(high-low)/2;
        if(X <= arr[mid])
    }
}

int main()
{
    int n=7,m=3;
    int scores[n]={2,1,5,4,3,5,3};
    int tasks[m]={8,9,12};
    int f[n];

    //generate
    f[0]=scores[0];
    for(int i=0;i<n;i++){
        f[i]=f[i-1]+scores[i];
    }

    //search
    for(int i=0;i<m;i++){
        //tasks[m]=tasks[m]%f[n-1];
        lowerbound(f,n,task[m])

    }

    return 0;
}