div20121216

来源：互联网发布：mac 双击打不开文件夹编辑：程序博客网时间：2024/05/19 09:41

#include<stdio.h>

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<math.h>
#include<vector>
#define INF 10000000
#define MAXN 1000
#define MAXL 1000
using namespace std;
bool cmp(int x,int y)
{
return x<y;
}
int main()
{
int n,sum1,sum2,sum3,a;
while(cin>>n)
{
sum1=sum2=sum3=0;
for(int i=1;i<=n;++i)
{
cin>>a;
if(i%3==1) sum1+=a;
else if(i%3==2) sum2+=a;
else sum3+=a;
}
if(sum1>sum2&&sum1>sum3)
{
cout<<"chest"<<endl;
continue;
}
if(sum2>sum1&&sum2>sum3)
{
cout<<"biceps"<<endl;
continue;
}
cout<<"back"<<endl;
}
return 0;
}

B
#include<iostream>
#include<string.h>
using namespace std;
char s[1000005];
int main()
{
while(cin>>s)
{
int l=strlen(s),X=0,Y=0;
for(int i=0;i<l;++i)
{
if(s[i]=='x')
X++;
else
Y++;
}
if(X==Y)
cout<<endl;
else if(X>Y)
{
int len1=X-Y;
for(int i=1;i<=len1;++i)
cout<<'x';
}
else
{
int len2=Y-X;
for(int i=1;i<=len2;++i)
cout<<'y';
}
cout<<endl;
}
return 0;

}

TLE的代码，优化后还是超时

#include<iostream>
using namespace std;
int a[4005];
int main()
{
int n,sum,max;
while(cin>>n)
{
for(int i=0;i<n;++i)
cin>>a[i];
if(n==1)
{
cout<<1<<endl;
continue;
}
if(n==2)
{
cout<<2<<endl;
continue;
}
max=2;
for(int i=0;i<n;++i)
{
for(int j=i+1;j<n;++j)
{
sum=2;
int q=a[j]-a[i];
q=-q;
int jj=j;
for(int k=jj+1;k<n;++k)
{
if(a[k]-a[jj]==q)
{
sum++;
q=-q;
jj=k;
if(sum>max)
max=sum;
}
}
}
}
cout<<max<<endl;
}
}