hdu 6205 card card card 尺取+超神读入挂

题没啥好说的 

我就是想把读入挂记录一下

update(2017-10-03）

把读入挂加上了调试 

#include<bits/stdc++.h>
#define cl(a,b) memset(a,b,sizeof(a))
#define debug(a) cerr<<#a<<"=="<<a<<endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int maxn=1e6+10;

int n;
int a[maxn*2];
int b[maxn*2];

#define JUDGE

#ifdef DEBUG
inline bool read(int &ret)
{
    if(scanf("%d",&ret)==EOF) return false;
    return true;
}
#endif  DEBUG

#ifdef JUDGE
namespace fastIO {
    #define BUF_SIZE 100000
    //fread -> read
    bool IOerror = 0;
    inline char nc() {
        static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
        if(p1 == pend) {
            p1 = buf;
            pend = buf + fread(buf, 1, BUF_SIZE, stdin);
            if(pend == p1) {
                IOerror = 1;
                return -1;
            }
        }
        return *p1++;
    }
    inline bool blank(char ch) {
        return ch == ' ' || ch == '
' || ch == '
' || ch == '	';
    }
    inline bool read(int &x) {
        char ch;
        while(blank(ch = nc()));
        if(IOerror)
            return false;
        for(x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0');
        return true;
    }
    #undef BUF_SIZE
};
using namespace fastIO;
#endif JUDGE

int chiqu(int n)
{
    int sum=0,mx=0,ans=0;
    for(int l=1,r=1; l<=n&&r<=n;)
    {
        if(sum>0) sum+=(a[r]-b[r++]);
        if(r-l+1>=mx)
        {
            mx=r-l+1;
            ans=l-1;
        }
        if(sum<=0) sum-=(a[l]-b[l++]);
    }
    return ans;
}

int main()
{
    while(read(n))
    {
        for(int i=1; i<=n; i++) read(a[i]);
        for(int i=1; i<=n; i++) read(b[i]);
        for(int i=1; i<=n; i++) a[i+n]=a[i],b[i+n]=b[i];
        int ans=chiqu(2*n);
//        debug(ans);
        printf("%d
",ans);
    }
    return 0;
}/*

5
4 6 2 8 4
1 5 7 9 2

*/