1402.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<iostream>
#include<fstream>
#include<vector>
using namespace std;

int main()
{
    // ifstream cin("in.txt");
     int n;
     while(cin>>n&&n)
     {
         vector<int> data(n);
         int sum=0;
         for(int i=0;i<n;i++)
         {    
              cin>>data[i];
              sum+=data[i];
         } 
         bool find=0;
         int t1=0;
         if(sum%2==0)
         {
             sum/=2;             
             int sumt=0;            
             while(t1<n)
             {
                 sumt+=data[t1];
                 if(sumt==sum) {find=1;break;}
                 else if(sumt>sum) break;
                 t1++;
             }
         }
         if(find) cout<<"Sam stops at position "<<++t1<<" and Ella stops at position "<<++t1<<".\n";
         else cout<<"No equal partitioning.\n";        
     }
}