一、连胜王
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a[100];
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
int lastWin = a[0];
int WinCnt = 1;
int maxWin = a[0];
int maxCnt = 1;
for(int i = 1;i<n;i++)
{
if(a[i]==lastWin)
{
WinCnt++;
}
else
{
WinCnt = 1;
}
if(maxCnt<WinCnt)
{
maxCnt = WinCnt;
maxWin = a[i];
}
lastWin = a[i];
}
cout<<maxWin<<" "<<maxCnt;
return 0;
}
二、数字母
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
char a[100];
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
char lastWiner = 'A';
int WinCnt = 0;
int maxWiner = 'A';
int maxCnt = 0;
for(int i = 0;i<n;i++)
{
if(a[i]==lastWiner)
{
WinCnt++;
}
else
{
WinCnt = 0;
}
if(WinCnt>maxCnt)
{
maxCnt = WinCnt;
}
}
cout<<maxCnt;
return 0;
}
三、投篮
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
char a[100];
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
int sum = 0;
char lastWiner = 'V';
int WinCnt = 0;
char maxWiner = 'V';
int maxCnt = 0;
for(int i = 0;i<n;i++)
{
if(a[i]=='X')
{
sum = sum-1;
WinCnt = 0;
}
else if(a[i] == 'T')
{
sum = sum+0;
WinCnt = 0;
}
else if(a[i] == 'V')
{
sum = sum+1;
WinCnt++;
}
if(WinCnt>=3) sum++;
}
cout<<sum;
return 0;
}
四、分数统计
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
char a[100];
int n,x1;
cin>>n>>x1;
a[0] = x1;
int sum = 0;
int maxsum = 0;
int cnt = 0;
for(int i = 0;i<n;i++)
{
a[i] = (a[i-1]*3703 + 1047)%n+1;
}
int lastWiner = a[0];
int WinCnt = 1;
int maxWinner = a[0];
int maxCnt = 0;
for(int i = 1;i<n;i++)
{
if(a[i]==lastWiner)
{
WinCnt++;
}
else
{
WinCnt = 1;
}
if(WinCnt==1) sum = 1;
else if(WinCnt==2) sum = 2;
else if(WinCnt>=3) sum = 3;
cnt[a[i]] = cnt[a[i]] = sum;
lastWiner = a[i];
}
int summax = -1
for(int i = 0;i<n;i++)
{
if(summax<cnt[i])
{
summax = cnt[i];
}
}
cout<<summax;
return 0;
}
五、温度统计员
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a[100];
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
int lastT = a[0];
int cnt = 1;
int maxcnt = 1;
for(int i = 1;i<n;i++)
{
if(lastT<=a[i])
{
cnt++;
}
else
{
cnt = 1;
}
if(maxcnt<cnt)
{
maxcnt = cnt;
}
}
cout<<maxcnt;
return 0;
}
六、连续最长的偶数
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a[100];
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
int cnt = 0;
int maxcnt = 0;
for(int i = 0;i<n;i++)
{
if(a[i]%2==0)
{
cnt++;
}
else
{
cnt = 0;
}
if(maxcnt<cnt)
{
maxcnt = cnt;
}
}
cout<<maxcnt;
return 0;
}