Codeforces Round#229 DIV2 A,B,C,D(二)

In a single line print an integer ― the maximum possible joy Sereja feels after he listens to a song.

3
1 1 2
2 2 3

4

1
2
5

-1

In the first sample, Dima and Inna play the first two notes at volume 1 (1 + 1 = 2, the condition holds), they should play the last note at volumes 1 and 2. Sereja's total joy equals: 1 1 + 1 1 + 1 2 = 4.

In the second sample, there is no such pair (x, y), that 1 ≤ x, y ≤ 2, x + y = 5, so Dima and Inna skip a note. Sereja's total joy equals -1.

#include 
            
             
#include 
             
               #include 
              
                #include 
               
                 using namespace std; typedef long long int LL; int n; LL a[110000],b[110000],ans; int main() { scanf("%d",&n); for(int i=0;i
                
                 >a[i]; for(int i=0;i
                 
                  >b[i]; for(int i=0;i
                  
                   =b[i]&&(b[i]/2)&&(b[i]-b[i]/2)) { ans+=b[i]/2*(b[i]-b[i]/2); } else ans+=-1; } cout<
                   
                    
 
                    
 
                    
 
                    
 C. Inna and Candy Boxes time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 
                    
 Inna loves sweets very much. She has n closed present boxes lines up in a row in front of her. Each of these boxes contains either a candy (Dima's work) or nothing (Sereja's work). Let's assume that the boxes are numbered from 1 to n, from left to right.
 
                    
 As the boxes are closed, Inna doesn't know which boxes contain candies and which boxes contain nothing. Inna chose number k and asked w questions to Dima to find that out. Each question is characterised by two integers li, ri (1 ≤ li ≤ ri ≤ n; r - l + 1 is divisible byk), the i-th question is: "Dima, is that true that among the boxes with numbers from li to ri, inclusive, the candies lie only in boxes with numbers li + k - 1, li + 2k - 1, li + 3k - 1, ..., ri "
 
                    
 Dima hates to say "no" to Inna. That's why he wonders, what number of actions he will have to make for each question to make the answer to the question positive. In one action, Dima can either secretly take the candy from any box or put a candy to any box (Dima has infinitely many candies). Help Dima count the number of actions for each Inna's question.





 
                    
 Please note that Dima doesn't change the array during Inna's questions. That's why when you calculate the number of operations for the current question, please assume that the sequence of boxes didn't change.
 Input 
                    
 The first line of the input contains three integers n, k and w (1 ≤ k ≤ min(n, 10), 1 ≤ n, w ≤ 105). The second line contains ncharacters. If the i-th box contains a candy, the i-th character of the line equals 1, otherwise it equals 0.
 
                    
 Each of the following w lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n) ― the description of the i-th question. It is guaranteed thatri - li + 1 is divisible by k.
 Output 
                    
 For each question, print a single number on a single line ― the minimum number of operations Dima needs to make the answer to the question positive.
 Sample test(s) input 
                    
10 3 3
1010100011
1 3
1 6
4 9
 output 
                    
1
3
2
 Note 
                    
 For the first question, you need to take a candy from the first box to make the answer positive. So the answer is 1.
 
                    
 For the second question, you need to take a candy from the first box, take a candy from the fifth box and put a candy to the sixth box. The answer is 3.
 
                    
 For the third question, you need to take a candy from the fifth box and put it to the sixth box. The answer is 2.
 
                    
 
                    
#include 
                     
                      
#include 
                      
                        #include 
                       
                         #include 
                        
                          #include 
                         
                           using namespace std; int n,k,w; string cmd; int tang[110000],bian[11][110000]; int main