2017 ACM/ICPC Asia Regional Shenyang Online card card card

题意：看后面也应该知道是什么意思了

解法：

我们设置l,r，符合条件就是l=起始点,r=当前点，不符合l=i+1

学习了一下FASTIO

 #include <iostream>
 #include <algorithm>
 #include <set>
 #include <string>
 #include <vector>
 #include <queue>
 #include <map>
 #include <stack>
 #include <list>
 #include <iomanip>
 #include <functional>
 #include <sstream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 //#define read read()
 #define edl putchar('\n')
 #define ll long long
 #define clr(a,b) memset(a,b,sizeof a)
 #define rep(i,m,n) for(int i=m ; i<=n ; i++)
 #define fep(i,n) for(int i=0 ; i<n ; i++)
 //inline int read{ int x=0;char c=getchar();while(c<'0' || c>'9')c=getchar();while(c>='0' && c<='9'){ x=x*10+c-'0';c=getchar(); }return x;}

 namespace FastIO {
     const int SIZE =  << ;
     char buf[SIZE], obuf[SIZE], str[];
     int bi = SIZE, bn = SIZE, opt;
     int read(char *s) {
         while (bn) {
             for (; bi < bn && buf[bi] <= ' '; bi++);
             if (bi < bn) break;
             bn = fread(buf, , SIZE, stdin);
             bi = ;
         }
         int sn = ;
         while (bn) {
             for (; bi < bn && buf[bi] > ' '; bi++) s[sn++] = buf[bi];
             if (bi < bn) break;
             bn = fread(buf, , SIZE, stdin);
             bi = ;
         }
         s[sn] = ;
         return sn;
     }
     bool read(int& x) {
         int n = read(str), bf;

         if (!n) return ;
         int i = ; if (str[i] == '-') bf = -, i++; else bf = ;
         for (x = ; i < n; i++) x = x *  + str[i] - '';
         if (bf < ) x = -x;
         return ;
     }
 };
 #define read(x) FastIO::read(x)
 using namespace std;
 int X[*],Y[*];
 const int maxn = ;
 int n, m, mp[maxn][maxn], link[maxn];
 bool vis[maxn];
 int main() {

     while(read(n)) {
         for(int i=;i<=n;i++){
             read(X[i]);
             X[n+i]=X[i];
         }
         for(int i=;i<=n;i++){
             read(Y[i]);
             Y[i]=X[i]-Y[i];
             Y[i+n]=Y[i];
         }
         int sum=;
         int ans=;
         int index=;
         int r=;
         int St;
         int Max=-((<<)-);
         for(int i=;i<=*n;i++){
             sum+=X[i];
             ans+=Y[i];
             if(sum>Max){
                 Max=sum;
                 St=index;
                 r=i;
             }
             if(ans<){
                 index=i+;
                 sum=;
                 ans=;
                 if(index>n+){
                     break;
                 }
             }
         }
         printf("%d\n",St-);
     }
     return ;
 }