雙指標移動

Problem DescriptionOne day, ZHJ came across a warrior novel named Kunlun in library. Soon, ZHJ fall into it.
He tells everybody how deeply he loves Kunlun no matter whom he meets.
He found it attractive so he decided to read the novel in the next N days. However, ZHJ had
his own schedule. So every day he had only few minutes to spend on the book. Besides, he was
accustomed to reading a novel continuously, that is, once he started to read the novel, he would
not stop until he had read the entire novel.
ZHJ wondered when he should begin to read the novel so that he could spend the least days
on the novel.InputThe input contains several cases.
The first line of each case contains two space-seperated integers N(2 <= N <= 10^5) and S(1 <= S <= 10^8) where N means ZHJ decides to finish the novel in the next N days, S means the novel would cost ZHJ S minutes.Then N lines follows.The ith line contains
an integer ai(1 <= ai <= 100) which means ZHJ has ai minutes' free time in the ith day.It is guaranteed that the sum of the free time of the N days is enough for ZHJ to finish the novel.OutputFor each test case, you should output a single line with a integer indicating the day ZHJ should start to read the novel.If there are several answers, output the smallest one.Sample Input

2 1009910020 1001234567891011121314151617181920

Sample Output

215

雙指標跑一遍~~~以前沒接觸過額~~

#include <iostream>#include <cstring>#include <cstdio>#define INF 0x3f3f3f3f#define BUG printf("here!\n")using namespace std;int num[100005];int main(){    int n,s;    while(scanf("%d%d",&n,&s)!=EOF)    {        int i;        for(i=0;i<n;i++)            scanf("%d",&num[i]);        int j=0;        i=0;        int ans=0;        int sum=num[0];        int ff=INF;        while(1)        {            if(sum>=s)            {                if(ff>j-i+1)                {                    ans=i;                    ff=j-i+1;                }                sum=sum-num[i];                i=i+1;            }            else            {                if(j+1==n)                    break;                sum=sum+num[j+1];                j++;            }        }        printf("%d\n",ans+1);    }    return 0;}