HDU 1422（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[200005];int main(){    int n;    while(scanf("%d",&n)!=EOF)    {        int i;        int a,b;        for(i=1;i<=n;i++)        {            scanf("%d%d",&a,&b);            dp[i]=a-b;        }        int sum=0;        int max=-1;        int Count=0;        for(i=1;i<2*n;i++)        {            sum+=dp[i%n+1];            if(sum>=0)            {                Count++;                if(Count>max)                    max=Count;                if(max==n)                    break;            }            else            {                sum=0;                Count=0;            }        }        printf("%d\n",max);    }    return 0;}