首页 > 代码库 > CodeForces 733B Parade
CodeForces 733B Parade
枚举。枚举交换哪一个即可。
#pragma comment(linker, "/STACK:1024000000,1024000000")#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<ctime>#include<iostream>using namespace std;typedef long long LL;const double pi=acos(-1.0);void File(){ freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout);}template <class T>inline void read(T &x){ char c = getchar(); x = 0; while(!isdigit(c)) c = getchar(); while(isdigit(c)) { x = x * 10 + c - ‘0‘; c = getchar(); }}int n;int L[100010],R[100010];int sumL,sumR;int ans,idx;int main(){ cin>>n; for(int i=1;i<=n;i++) { cin>>L[i]>>R[i]; sumL=sumL+L[i]; sumR=sumR+R[i]; } ans=abs(sumR-sumL); for(int i=1;i<=n;i++) { sumL=sumL-L[i]; sumR=sumR-R[i]; sumL=sumL+R[i]; sumR=sumR+L[i]; if(abs(sumR-sumL)>ans) { ans=abs(sumR-sumL); idx=i; } sumL=sumL-R[i]; sumR=sumR-L[i]; sumL=sumL+L[i]; sumR=sumR+R[i]; } cout<<idx<<endl; return 0;}
CodeForces 733B Parade
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。