Kadane's Algo in C

#include <stdio.h>

int main(void) {
    int n ; 
    scanf("%d",&n);
    int arr[n];
    for(int i=0 ; i<n; i++){
        scanf("%d",&arr[i]);
    }
    
    int omax  = arr[0];
        int cmax = arr[0];
        
        int i = 1;
        
        while(i<n){
            
            if(cmax>0){
                cmax += arr[i];
            }
            else
                cmax  = arr[i];
                
            if(omax<cmax){
                omax = cmax;
            }
            i++;        
        }
        
    printf("%d",omax);
    
}