1148A - Another One Bites The Dust - CodeForces Solution

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int,int> pii;
const int N=3e6+10,mod=1e9+7;
//nihao

void solve()
{
    int a,b,c;
    cin>>a>>b>>c;
    int ans=min(a,b)*2+c*2;
    if(a!=b) ans++;
    cout<<ans<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}