/*
PROG: beads
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
using namespace std;
ifstream fin("beads.in");
ofstream fout("beads.out");
int n,best=0;
char neck[400];
int main()
{
fin>>n>>neck;
int right,left,k,l=0;
char c;
for(int i=0;i<n;i++)
{
k=i; right=left=l=0;
while(neck[k]=='w'&&l<n) right++,k=(k+1)%n,l++;
c=neck[k],l=0;
while(( neck[k]==c || neck[k]=='w') &&l<n)right++,k=(k+1)%n,l++;
k=(i-1+n)%n,l=0;
while(neck[k]=='w'&&l<n) left++,k=(k-1+n)%n,l++;
c=neck[k],l=0;
while(( neck[k]==c || neck[k]=='w') &&l<n) left++,k=(k-1+n)%n,l++;
if(best<left+right)best=left+right;
if(best>n){best=n;break;}
}
fout<<best<<endl;
return 0;
}
Compiling...
Compile: OK
Executing...
Test 1: TEST OK [0.004 secs]
Test 2: TEST OK [0.004 secs]
Test 3: TEST OK [0 secs]
Test 4: TEST OK [0.004 secs]
Test 5: TEST OK [0 secs]
Test 6: TEST OK [0.004 secs]
Test 7: TEST OK [0.004 secs]
Test 8: TEST OK [0 secs]
Test 9: TEST OK [0.004 secs]
All tests OK.
YOUR PROGRAM ( ' beads ' ) WORKED FIRST TIME !
That ' s fantastic -- and a rare thing.
Please accept these special automated congratulations.
USACO 1.1.4 Broken Necklace
最新推荐文章于 2020-01-26 22:54:51 发布