Codeforces Round #464 (Div. 2)C. Convenient For Everybody

简单的尺取法吧，昨天心态玩到爆炸，时区搞不准。。无奈自我退战了一波。

#include
using namespace std;
#define pb push_back
#define mp make_pair
int  a[100005];

int main()
{
int n;
scanf("%d",&n);
for(int i=1;ians)
    {
         ans=sum;
         ans1=(s-i+1+n)%n;
         if(ans1==0)ans1=n;
    }
}

for(int i=1;i<=n;i++)
{
    int tmp=(i+len-1)%n,tmp1=i-1;
    sum-=a[tmp1];
    sum+=a[tmp];
    if(sum==ans)
    {
        int tmp2=(s-i+1+n)%n;;
        if(tmp2==0)tmp2=n;
         ans1=min(ans1,tmp2);
    }
}
cout<