Important alert: (current site time 4/23/2014 6:48:49 AM EDT)

VB icon

Milking Cows

Submitted on: 9/14/2011 4:44:51 PM
By: Jeremiah Flaga  
Level: Beginner
User Rating: Unrated
Compatibility: C++ (general)
Views: 2672
author picture
(About the author)
     This is my solution to USACO's programming contest problem named "Milking Cows". Please go to the URL below to read the problem specification.


Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
Terms of Agreement:   
By using this code, you agree to the following terms...   
  1. You may use this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge.
  2. You MAY NOT redistribute this code (for example to a web site) without written permission from the original author. Failure to do so is a violation of copyright laws.   
  3. You may link to this code from another website, but ONLY if it is not wrapped in a frame. 
  4. You will abide by any additional copyright restrictions which the author may have placed in the code or code's description.
// Name: Milking Cows
// Description:This is my solution to USACO's programming contest problem named "Milking Cows". Please go to the URL below to read the problem specification. 
// By: Jeremiah Flaga
//This code is copyrighted and has// limited warranties.Please see details.//**************************************

ID: jeremia4
PROG: milk2
//Milking cows - brute force
#include <iostream>
#include <bitset>
#include <fstream>
#define N 1000000
using namespace std;
ifstream cin("");
ofstream cout("milk2.out");
long n; // no of data
cin >> n;
bitset<N> a;
long begin, end,
 largest = 0, smallest = N, // largest anf smallest input data
 longestcontinuous = 0, longestidle = 0;
//storing data in bitset
for(int i = 0; i < n; i++)
cin >> begin >> end;
for(int j = begin + 1; j <= end; j++)
if(begin < smallest) smallest = begin + 1;
if(end > largest) largest = end;
//determining longest continuous and longest idle
long toggler = 0, start = smallest;
for (long i = smallest; i <= largest + 1; ++i)
if(a[i] != toggler)
if(toggler == 1)
if(i - start > longestcontinuous)
longestcontinuous = i - start ;
toggler = 0;
start = i;
else // if toggler == 0
if(i - start > longestidle)
longestidle = i - start;
toggler = 1;
start = i;
cout << longestcontinuous << " " << longestidle << endl;

Other 20 submission(s) by this author


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Beginner category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)

Other User Comments

 There are no comments on this submission.

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)

To post feedback, first please login.